Base | Representation |
---|---|
bin | 11101111101010100101… |
… | …01000001010101011100 |
3 | 10122101221111200211121000 |
4 | 32332222111001111130 |
5 | 113331104313232311 |
6 | 2104513514110300 |
7 | 134240241420300 |
oct | 16765225012534 |
9 | 3571844624530 |
10 | 1029354820956 |
11 | 367601a63400 |
12 | 1475b4a1b390 |
13 | 760b5aa7097 |
14 | 37b6cd07d00 |
15 | 1bb988eb056 |
hex | efaa54155c |
1029354820956 has 1296 divisors, whose sum is σ = 3710504075040. Its totient is φ = 245727820800.
The previous prime is 1029354820927. The next prime is 1029354820957. The reversal of 1029354820956 is 6590284539201.
1029354820956 is a `hidden beast` number, since 1 + 0 + 2 + 9 + 3 + 548 + 2 + 0 + 95 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1029354820957) by changing a digit.
It is a polite number, since it can be written in 431 ways as a sum of consecutive naturals, for example, 14100750936 + ... + 14100751008.
Almost surely, 21029354820956 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1029354820956, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1855252037520).
1029354820956 is an abundant number, since it is smaller than the sum of its proper divisors (2681149254084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1029354820956 is a wasteful number, since it uses less digits than its factorization.
1029354820956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221 (or 176 counting only the distinct ones).
The product of its (nonzero) digits is 4665600, while the sum is 54.
The spelling of 1029354820956 in words is "one trillion, twenty-nine billion, three hundred fifty-four million, eight hundred twenty thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •