Base | Representation |
---|---|
bin | 101110101011000101… |
… | …1111111110011100001 |
3 | 100120201012212101222110 |
4 | 1131112023333303201 |
5 | 3120232414431223 |
6 | 114013425425533 |
7 | 10145540632440 |
oct | 1352613776341 |
9 | 316635771873 |
10 | 100230233313 |
11 | 39564398871 |
12 | 17512a9b2a9 |
13 | 95b4420c82 |
14 | 4bcb872d57 |
15 | 2919566d93 |
hex | 17562ffce1 |
100230233313 has 16 divisors (see below), whose sum is σ = 159372297216. Its totient is φ = 54784226640.
The previous prime is 100230233293. The next prime is 100230233339. The reversal of 100230233313 is 313332032001.
It is not a de Polignac number, because 100230233313 - 229 = 99693362401 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100230233313.
It is not an unprimeable number, because it can be changed into a prime (100230233393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 103757523 + ... + 103758488.
It is an arithmetic number, because the mean of its divisors is an integer number (9960768576).
Almost surely, 2100230233313 is an apocalyptic number.
It is an amenable number.
100230233313 is a deficient number, since it is larger than the sum of its proper divisors (59142063903).
100230233313 is a wasteful number, since it uses less digits than its factorization.
100230233313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207516044.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 100230233313 its reverse (313332032001), we get a palindrome (413562265314).
The spelling of 100230233313 in words is "one hundred billion, two hundred thirty million, two hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •