Base | Representation |
---|---|
bin | 11101110100001000111… |
… | …11110101000111110100 |
3 | 10121221012221122202110210 |
4 | 32322010133311013310 |
5 | 113241010314344022 |
6 | 2102340414145420 |
7 | 134004132061452 |
oct | 16720437650764 |
9 | 3557187582423 |
10 | 1024425153012 |
11 | 365502323968 |
12 | 146659ab2270 |
13 | 757ab6a21c1 |
14 | 378223139d2 |
15 | 1b9aac38a0c |
hex | ee847f51f4 |
1024425153012 has 48 divisors (see below), whose sum is σ = 2499640012800. Its totient is φ = 325922808288.
The previous prime is 1024425153007. The next prime is 1024425153013. The reversal of 1024425153012 is 2103515244201.
It is a super-2 number, since 2×10244251530122 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1024425153013) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3880512 + ... + 4136087.
It is an arithmetic number, because the mean of its divisors is an integer number (52075833600).
Almost surely, 21024425153012 is an apocalyptic number.
1024425153012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1024425153012 is an abundant number, since it is smaller than the sum of its proper divisors (1475214859788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1024425153012 is a wasteful number, since it uses less digits than its factorization.
1024425153012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8017092 (or 8017090 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
The spelling of 1024425153012 in words is "one trillion, twenty-four billion, four hundred twenty-five million, one hundred fifty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •