Base | Representation |
---|---|
bin | 11011010010001111101111… |
… | …000100100000111010000100 |
3 | 120201212222211010210122210221 |
4 | 123102033233010200322010 |
5 | 111212044224132032212 |
6 | 1103115424553154124 |
7 | 34163536116000232 |
oct | 3322175704407204 |
9 | 521788733718727 |
10 | 120001102220932 |
11 | 352661aa8660a9 |
12 | 115610263bb944 |
13 | 51c60948a74ca |
14 | 218c1275c9952 |
15 | dd17862c9807 |
hex | 6d23ef120e84 |
120001102220932 has 6 divisors (see below), whose sum is σ = 210001928886638. Its totient is φ = 60000551110464.
The previous prime is 120001102220911. The next prime is 120001102220933. The reversal of 120001102220932 is 239022201100021.
It can be written as a sum of positive squares in only one way, i.e., 119930227002756 + 70875218176 = 10951266^2 + 266224^2 .
It is a junction number, because it is equal to n+sod(n) for n = 120001102220897 and 120001102220906.
It is not an unprimeable number, because it can be changed into a prime (120001102220933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15000137777613 + ... + 15000137777620.
Almost surely, 2120001102220932 is an apocalyptic number.
It is an amenable number.
120001102220932 is a deficient number, since it is larger than the sum of its proper divisors (90000826665706).
120001102220932 is a wasteful number, since it uses less digits than its factorization.
120001102220932 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30000275555237 (or 30000275555235 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 120001102220932 its reverse (239022201100021), we get a palindrome (359023303320953).
The spelling of 120001102220932 in words is "one hundred twenty trillion, one billion, one hundred two million, two hundred twenty thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •