Base | Representation |
---|---|
bin | 101011010011011… |
… | …0001101010111100 |
3 | 10202021002022211112 |
4 | 1112212301222330 |
5 | 10433432134000 |
6 | 400102541152 |
7 | 51002225432 |
oct | 12646615274 |
9 | 3667068745 |
10 | 1453005500 |
11 | 6862025a1 |
12 | 3467377b8 |
13 | 1a2049b8b |
14 | dad8cd52 |
15 | 87865235 |
hex | 569b1abc |
1453005500 has 24 divisors (see below), whose sum is σ = 3173365104. Its totient is φ = 581202000.
The previous prime is 1453005479. The next prime is 1453005509. The reversal of 1453005500 is 55003541.
It is a super-2 number, since 2×14530055002 = 4222449966060500000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1453005509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1452506 + ... + 1453505.
It is an arithmetic number, because the mean of its divisors is an integer number (132223546).
Almost surely, 21453005500 is an apocalyptic number.
1453005500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1453005500 is an abundant number, since it is smaller than the sum of its proper divisors (1720359604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1453005500 is a wasteful number, since it uses less digits than its factorization.
1453005500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906030 (or 2906018 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 23.
The square root of 1453005500 is about 38118.3092489685. The cubic root of 1453005500 is about 1132.6326743806.
The spelling of 1453005500 in words is "one billion, four hundred fifty-three million, five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •