Base | Representation |
---|---|
bin | 10110110100000001101001… |
… | …010001000000010100100001 |
3 | 111011020122221200011201201020 |
4 | 112310001221101000110201 |
5 | 101122320322214200001 |
6 | 553215551034400053 |
7 | 30063522333330234 |
oct | 2664015121002441 |
9 | 434218850151636 |
10 | 100332202100001 |
11 | 29a72714480863 |
12 | b305077590029 |
13 | 43ca3946250a1 |
14 | 1aac166a2541b |
15 | b8ed0e08b736 |
hex | 5b4069440521 |
100332202100001 has 4 divisors (see below), whose sum is σ = 133776269466672. Its totient is φ = 66888134733332.
The previous prime is 100332202099931. The next prime is 100332202100027. The reversal of 100332202100001 is 100001202233001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100332202100001 - 210 = 100332202098977 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (100332202100101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16722033683331 + ... + 16722033683336.
It is an arithmetic number, because the mean of its divisors is an integer number (33444067366668).
Almost surely, 2100332202100001 is an apocalyptic number.
It is an amenable number.
100332202100001 is a deficient number, since it is larger than the sum of its proper divisors (33444067366671).
100332202100001 is an equidigital number, since it uses as much as digits as its factorization.
100332202100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33444067366670.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 100332202100001 its reverse (100001202233001), we get a palindrome (200333404333002).
The spelling of 100332202100001 in words is "one hundred trillion, three hundred thirty-two billion, two hundred two million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •