Base | Representation |
---|---|
bin | 101111110100010001010100… |
… | …110110010101111100000011 |
3 | 1000120121111120200021211101211 |
4 | 233310101110312111330003 |
5 | 210031024303231304443 |
6 | 2023134325033510551 |
7 | 62203455025460221 |
oct | 5764212466257403 |
9 | 1016544520254354 |
10 | 210300202213123 |
11 | 6100a8a66a8350 |
12 | 1b705708272457 |
13 | 90462bb0c6729 |
14 | 39d0826a91b11 |
15 | 194a5ce2d619d |
hex | bf4454d95f03 |
210300202213123 has 32 divisors (see below), whose sum is σ = 232888382496000. Its totient is φ = 188297911296000.
The previous prime is 210300202213103. The next prime is 210300202213133. The reversal of 210300202213123 is 321312202003012.
It is not a de Polignac number, because 210300202213123 - 25 = 210300202213091 is a prime.
It is a super-2 number, since 2×2103002022131232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210300202213094 and 210300202213103.
It is not an unprimeable number, because it can be changed into a prime (210300202213103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1641636528 + ... + 1641764626.
It is an arithmetic number, because the mean of its divisors is an integer number (7277761953000).
Almost surely, 2210300202213123 is an apocalyptic number.
210300202213123 is a deficient number, since it is larger than the sum of its proper divisors (22588180282877).
210300202213123 is a wasteful number, since it uses less digits than its factorization.
210300202213123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131043.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 210300202213123 its reverse (321312202003012), we get a palindrome (531612404216135).
The spelling of 210300202213123 in words is "two hundred ten trillion, three hundred billion, two hundred two million, two hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •