Base | Representation |
---|---|
bin | 101111110000010101111101… |
… | …011011100111001110000101 |
3 | 1000112122200220201220111210101 |
4 | 233300111331123213032011 |
5 | 210012114023313212404 |
6 | 2022410330551324101 |
7 | 62145121426601053 |
oct | 5760257533471605 |
9 | 1015580821814711 |
10 | 210030300132229 |
11 | 60a16393a45165 |
12 | 1b681342680631 |
13 | 9026a06a25515 |
14 | 39c1740da71d3 |
15 | 19435841442a4 |
hex | bf057d6e7385 |
210030300132229 has 16 divisors (see below), whose sum is σ = 213696463026816. Its totient is φ = 206383893408000.
The previous prime is 210030300132227. The next prime is 210030300132287. The reversal of 210030300132229 is 922231003030012.
It is a cyclic number.
It is not a de Polignac number, because 210030300132229 - 21 = 210030300132227 is a prime.
It is a super-2 number, since 2×2100303001322292 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210030300132197 and 210030300132206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210030300132227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 335382769 + ... + 336008425.
It is an arithmetic number, because the mean of its divisors is an integer number (13356028939176).
Almost surely, 2210030300132229 is an apocalyptic number.
It is an amenable number.
210030300132229 is a deficient number, since it is larger than the sum of its proper divisors (3666162894587).
210030300132229 is a wasteful number, since it uses less digits than its factorization.
210030300132229 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 641436.
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 210030300132229 in words is "two hundred ten trillion, thirty billion, three hundred million, one hundred thirty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •