Base | Representation |
---|---|
bin | 10110110100000001100011… |
… | …010011101010001001001101 |
3 | 111011020122200201001211210211 |
4 | 112310001203103222021031 |
5 | 101122320121121213201 |
6 | 553215533104002421 |
7 | 30063520010531224 |
oct | 2664014323521115 |
9 | 434218621054724 |
10 | 100332102132301 |
11 | 29a72673001626 |
12 | b30504a000411 |
13 | 43ca3799c31c0 |
14 | 1aac157641cbb |
15 | b8ed053e1651 |
hex | 5b40634ea24d |
100332102132301 has 8 divisors (see below), whose sum is σ = 110348891380224. Its totient is φ = 90643732204080.
The previous prime is 100332102132239. The next prime is 100332102132343. The reversal of 100332102132301 is 103231201233001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100332102132301 - 27 = 100332102132173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100332102132391) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82104829285 + ... + 82104830506.
It is an arithmetic number, because the mean of its divisors is an integer number (13793611422528).
Almost surely, 2100332102132301 is an apocalyptic number.
It is an amenable number.
100332102132301 is a deficient number, since it is larger than the sum of its proper divisors (10016789247923).
100332102132301 is a wasteful number, since it uses less digits than its factorization.
100332102132301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164209659851.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 100332102132301 its reverse (103231201233001), we get a palindrome (203563303365302).
The spelling of 100332102132301 in words is "one hundred trillion, three hundred thirty-two billion, one hundred two million, one hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.245 sec. • engine limits •