Base | Representation |
---|---|
bin | 10011010011110110… |
… | …00010110011000101 |
3 | 222202111101012020012 |
4 | 21221323002303011 |
5 | 132212424121404 |
6 | 4432413120005 |
7 | 514622134526 |
oct | 115173026305 |
9 | 28674335205 |
10 | 10367020229 |
11 | 443aa04815 |
12 | 2013a89005 |
13 | c92a526c7 |
14 | 704bc084d |
15 | 40a209a6e |
hex | 269ec2cc5 |
10367020229 has 8 divisors (see below), whose sum is σ = 10448602560. Its totient is φ = 10285475200.
The previous prime is 10367020219. The next prime is 10367020231. The reversal of 10367020229 is 92202076301.
It is a happy number.
10367020229 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 10367020229 - 212 = 10367016133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10367020195 and 10367020204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10367020219) 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, 870344 + ... + 882174.
It is an arithmetic number, because the mean of its divisors is an integer number (1306075320).
Almost surely, 210367020229 is an apocalyptic number.
It is an amenable number.
10367020229 is a deficient number, since it is larger than the sum of its proper divisors (81582331).
10367020229 is a wasteful number, since it uses less digits than its factorization.
10367020229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18651.
The product of its (nonzero) digits is 9072, while the sum is 32.
The spelling of 10367020229 in words is "ten billion, three hundred sixty-seven million, twenty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •