Base | Representation |
---|---|
bin | 1001010011100101001010… |
… | …1111101100000110110001 |
3 | 1100020011120200210020122000 |
4 | 2110321102233230012301 |
5 | 2320120114041112314 |
6 | 33432303245204213 |
7 | 2104144335544425 |
oct | 224712257540661 |
9 | 40204520706560 |
10 | 10232000332209 |
11 | 3295404492467 |
12 | 1193044260669 |
13 | 592b480a20c6 |
14 | 27533519cb85 |
15 | 12b25791c209 |
hex | 94e52bec1b1 |
10232000332209 has 32 divisors (see below), whose sum is σ = 15166787328000. Its totient is φ = 6817613859072.
The previous prime is 10232000332153. The next prime is 10232000332219. The reversal of 10232000332209 is 90223300023201.
10232000332209 is a `hidden beast` number, since 1 + 0 + 2 + 320 + 0 + 0 + 332 + 2 + 0 + 9 = 666.
10232000332209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10232000332209 - 211 = 10232000330161 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10232000332219) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 525543727 + ... + 525563195.
It is an arithmetic number, because the mean of its divisors is an integer number (473962104000).
Almost surely, 210232000332209 is an apocalyptic number.
It is an amenable number.
10232000332209 is a deficient number, since it is larger than the sum of its proper divisors (4934786995791).
10232000332209 is a wasteful number, since it uses less digits than its factorization.
10232000332209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29094 (or 29088 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The spelling of 10232000332209 in words is "ten trillion, two hundred thirty-two billion, three hundred thirty-two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •