Base | Representation |
---|---|
bin | 10011110111000001… |
… | …10001011011001100 |
3 | 1000112001122222102022 |
4 | 21323200301123030 |
5 | 133314000420322 |
6 | 4521554145312 |
7 | 525134360216 |
oct | 117340613314 |
9 | 30461588368 |
10 | 10662123212 |
11 | 4581543a84 |
12 | 2096882238 |
13 | 100bc27560 |
14 | 73207b5b6 |
15 | 42609c942 |
hex | 27b8316cc |
10662123212 has 24 divisors (see below), whose sum is σ = 20301165696. Its totient is φ = 4870245888.
The previous prime is 10662123211. The next prime is 10662123247. The reversal of 10662123212 is 21232126601.
It is a happy number.
10662123212 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×106621232122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is not an unprimeable number, because it can be changed into a prime (10662123211) by changing a digit.
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, 1051868 + ... + 1061955.
It is an arithmetic number, because the mean of its divisors is an integer number (845881904).
Almost surely, 210662123212 is an apocalyptic number.
It is an amenable number.
10662123212 is a deficient number, since it is larger than the sum of its proper divisors (9639042484).
10662123212 is a wasteful number, since it uses less digits than its factorization.
10662123212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2113937 (or 2113935 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 10662123212 its reverse (21232126601), we get a palindrome (31894249813).
The spelling of 10662123212 in words is "ten billion, six hundred sixty-two million, one hundred twenty-three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •