Base | Representation |
---|---|
bin | 101110101110000110… |
… | …1001111011111100101 |
3 | 100120222020220012210201 |
4 | 1131130031033133211 |
5 | 3120434243114023 |
6 | 114031434150501 |
7 | 10151205216160 |
oct | 1353415173745 |
9 | 316866805721 |
10 | 100331223013 |
11 | 396063a592a |
12 | 17540882431 |
13 | 95cc3200a8 |
14 | 4bdb040ad7 |
15 | 2923364bad |
hex | 175c34f7e5 |
100331223013 has 8 divisors (see below), whose sum is σ = 114845978240. Its totient is φ = 85861898640.
The previous prime is 100331223011. The next prime is 100331223061. The reversal of 100331223013 is 310322133001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100331223013 - 21 = 100331223011 is a prime.
It is a super-2 number, since 2×1003312230132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100331223011) 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 7 ways as a sum of consecutive naturals, for example, 11352978 + ... + 11361811.
It is an arithmetic number, because the mean of its divisors is an integer number (14355747280).
Almost surely, 2100331223013 is an apocalyptic number.
It is an amenable number.
100331223013 is a deficient number, since it is larger than the sum of its proper divisors (14514755227).
100331223013 is an equidigital number, since it uses as much as digits as its factorization.
100331223013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22715427.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 100331223013 its reverse (310322133001), we get a palindrome (410653356014).
The spelling of 100331223013 in words is "one hundred billion, three hundred thirty-one million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •