Base | Representation |
---|---|
bin | 10110110001001000001000… |
… | …000000111011011110111010 |
3 | 111010112121210002001012011100 |
4 | 112301020020000323132322 |
5 | 101111034342003002224 |
6 | 552544244401112230 |
7 | 30043241064403143 |
oct | 2661101000733672 |
9 | 433477702035140 |
10 | 100133002000314 |
11 | 299a61931925a8 |
12 | b292543928676 |
13 | 43b4669c5260a |
14 | 1aa266ac84aca |
15 | b89a50e6eac9 |
hex | 5b120803b7ba |
100133002000314 has 48 divisors (see below), whose sum is σ = 221583713674752. Its totient is φ = 32665614715104.
The previous prime is 100133002000313. The next prime is 100133002000319. The reversal of 100133002000314 is 413000200331001.
100133002000314 is a `hidden beast` number, since 1 + 0 + 0 + 1 + 330 + 0 + 20 + 0 + 0 + 314 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (100133002000313) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11249407 + ... + 18078029.
It is an arithmetic number, because the mean of its divisors is an integer number (4616327368224).
Almost surely, 2100133002000314 is an apocalyptic number.
100133002000314 is an abundant number, since it is smaller than the sum of its proper divisors (121450711674438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100133002000314 is a wasteful number, since it uses less digits than its factorization.
100133002000314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6846011 (or 6846008 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 100133002000314 its reverse (413000200331001), we get a palindrome (513133202331315).
The spelling of 100133002000314 in words is "one hundred trillion, one hundred thirty-three billion, two million, three hundred fourteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •