Base | Representation |
---|---|
bin | 11101111111101001101… |
… | …10011010111010000000 |
3 | 10122112011122022002212220 |
4 | 32333310312122322000 |
5 | 113341134400343212 |
6 | 2105241535451040 |
7 | 134313232504641 |
oct | 16776466327200 |
9 | 3575148262786 |
10 | 1030605090432 |
11 | 368093784365 |
12 | 1478a3686a80 |
13 | 76254b1c4c8 |
14 | 37c4ada16c8 |
15 | 1bc1d56638c |
hex | eff4d9ae80 |
1030605090432 has 32 divisors (see below), whose sum is σ = 2737544772480. Its totient is φ = 343535030016.
The previous prime is 1030605090371. The next prime is 1030605090479. The reversal of 1030605090432 is 2340905060301.
It is a tau number, because it is divible by the number of its divisors (32).
It is a junction number, because it is equal to n+sod(n) for n = 1030605090393 and 1030605090402.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1341933328 + ... + 1341934095.
It is an arithmetic number, because the mean of its divisors is an integer number (85548274140).
Almost surely, 21030605090432 is an apocalyptic number.
1030605090432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1030605090432 is an abundant number, since it is smaller than the sum of its proper divisors (1706939682048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030605090432 is an equidigital number, since it uses as much as digits as its factorization.
1030605090432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2683867440 (or 2683867428 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
The spelling of 1030605090432 in words is "one trillion, thirty billion, six hundred five million, ninety thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •