Base | Representation |
---|---|
bin | 1001100100000101011111… |
… | …11101110101010001111001 |
3 | 2202110112222100210112002010 |
4 | 10302002233331311101321 |
5 | 10224033204144244113 |
6 | 112421320505000133 |
7 | 4300306364211444 |
oct | 462025775652171 |
9 | 82415870715063 |
10 | 21031112103033 |
11 | 677927655847a |
12 | 2437b78a83049 |
13 | b972c11721a6 |
14 | 529ca86bc65b |
15 | 267102b9d1c3 |
hex | 1320aff75479 |
21031112103033 has 8 divisors (see below), whose sum is σ = 28043099004096. Its totient is φ = 14019933302000.
The previous prime is 21031112102999. The next prime is 21031112103041. The reversal of 21031112103033 is 33030121113012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21031112103033 - 222 = 21031107908729 is a prime.
It is a super-2 number, since 2×210311121030332 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21031112103083) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 201964278 + ... + 202068383.
It is an arithmetic number, because the mean of its divisors is an integer number (3505387375512).
Almost surely, 221031112103033 is an apocalyptic number.
It is an amenable number.
21031112103033 is a deficient number, since it is larger than the sum of its proper divisors (7011986901063).
21031112103033 is a wasteful number, since it uses less digits than its factorization.
21031112103033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404050015.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 21031112103033 its reverse (33030121113012), we get a palindrome (54061233216045).
The spelling of 21031112103033 in words is "twenty-one trillion, thirty-one billion, one hundred twelve million, one hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •