Base | Representation |
---|---|
bin | 10010110100001010… |
… | …11101001100011101 |
3 | 222001222101221021002 |
4 | 21122011131030131 |
5 | 131141414024313 |
6 | 4350202120045 |
7 | 505214520005 |
oct | 113205351435 |
9 | 28058357232 |
10 | 10101314333 |
11 | 4313a23a70 |
12 | 1b5aab0025 |
13 | c4c9a1296 |
14 | 6bb7b7005 |
15 | 3e1c22058 |
hex | 25a15d31d |
10101314333 has 8 divisors (see below), whose sum is σ = 11021880000. Its totient is φ = 9181126080.
The previous prime is 10101314329. The next prime is 10101314369. The reversal of 10101314333 is 33341310101.
10101314333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10101314333 - 22 = 10101314329 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 (10101314323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36860 + ... + 146837.
It is an arithmetic number, because the mean of its divisors is an integer number (1377735000).
Almost surely, 210101314333 is an apocalyptic number.
It is an amenable number.
10101314333 is a deficient number, since it is larger than the sum of its proper divisors (920565667).
10101314333 is a wasteful number, since it uses less digits than its factorization.
10101314333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188707.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10101314333 its reverse (33341310101), we get a palindrome (43442624434).
The spelling of 10101314333 in words is "ten billion, one hundred one million, three hundred fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •