Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …010110000010011010110111 |
3 | 111010002002200002102111111121 |
4 | 112233032020112002122313 |
5 | 101101413104310444343 |
6 | 552404142322044411 |
7 | 30030623025500110 |
oct | 2657161026023267 |
9 | 433062602374447 |
10 | 100002011031223 |
11 | 299556841a8754 |
12 | b2710871a9707 |
13 | 43a51c2983352 |
14 | 1a9a1a1d3d207 |
15 | b86436110aed |
hex | 5af3885826b7 |
100002011031223 has 8 divisors (see below), whose sum is σ = 114551957212448. Its totient is φ = 85518051001344.
The previous prime is 100002011031203. The next prime is 100002011031269. The reversal of 100002011031223 is 322130110200001.
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 100002011031223 - 229 = 100001474160311 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100002011031197 and 100002011031206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002011031203) 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, 16496534586 + ... + 16496540647.
It is an arithmetic number, because the mean of its divisors is an integer number (14318994651556).
Almost surely, 2100002011031223 is an apocalyptic number.
100002011031223 is a deficient number, since it is larger than the sum of its proper divisors (14549946181225).
100002011031223 is an equidigital number, since it uses as much as digits as its factorization.
100002011031223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32993075673.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 100002011031223 its reverse (322130110200001), we get a palindrome (422132121231224).
The spelling of 100002011031223 in words is "one hundred trillion, two billion, eleven million, thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •