Base | Representation |
---|---|
bin | 1011000000011011100011… |
… | …0010111001011110101010 |
3 | 1120211221102210202211112010 |
4 | 2300012320302321132222 |
5 | 3041234420421120320 |
6 | 41423332005500350 |
7 | 2356225263054654 |
oct | 260067062713652 |
9 | 46757383684463 |
10 | 12102023223210 |
11 | 39464916794a8 |
12 | 14355531116b6 |
13 | 69a2a6417c0b |
14 | 2dba536216d4 |
15 | 15ec04aa8ae0 |
hex | b01b8cb97aa |
12102023223210 has 64 divisors (see below), whose sum is σ = 29983965364224. Its totient is φ = 3122875809600.
The previous prime is 12102023223209. The next prime is 12102023223259. The reversal of 12102023223210 is 1232232020121.
12102023223210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×121020232232102 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12523465 + ... + 13455155.
It is an arithmetic number, because the mean of its divisors is an integer number (468499458816).
Almost surely, 212102023223210 is an apocalyptic number.
12102023223210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12102023223210 is an abundant number, since it is smaller than the sum of its proper divisors (17881942141014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12102023223210 is a wasteful number, since it uses less digits than its factorization.
12102023223210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 945699.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12102023223210 its reverse (1232232020121), we get a palindrome (13334255243331).
The spelling of 12102023223210 in words is "twelve trillion, one hundred two billion, twenty-three million, two hundred twenty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •