Base | Representation |
---|---|
bin | 1001001000100001011111… |
… | …0100010010011100001000 |
3 | 1022120000020112222001001211 |
4 | 2102020113310102130020 |
5 | 2304012040434333112 |
6 | 33205125112422504 |
7 | 2054340641104543 |
oct | 222102764223410 |
9 | 38500215861054 |
10 | 10042033121032 |
11 | 32218909a0a80 |
12 | 11622686a7a34 |
13 | 57ac624b0883 |
14 | 26a07373785a |
15 | 12633a1810a7 |
hex | 92217d12708 |
10042033121032 has 32 divisors (see below), whose sum is σ = 20540644394400. Its totient is φ = 4564533376000.
The previous prime is 10042033120969. The next prime is 10042033121137. The reversal of 10042033121032 is 23012133024001.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 10042033120994 and 10042033121012.
It is an unprimeable number.
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, 26989719 + ... + 27359257.
It is an arithmetic number, because the mean of its divisors is an integer number (641895137325).
Almost surely, 210042033121032 is an apocalyptic number.
It is an amenable number.
10042033121032 is an abundant number, since it is smaller than the sum of its proper divisors (10498611273368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10042033121032 is a wasteful number, since it uses less digits than its factorization.
10042033121032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 678357 (or 678353 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10042033121032 its reverse (23012133024001), we get a palindrome (33054166145033).
The spelling of 10042033121032 in words is "ten trillion, forty-two billion, thirty-three million, one hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •