Base | Representation |
---|---|
bin | 101111110000011000111000… |
… | …100101101110110101011011 |
3 | 1000112200000000120100122002012 |
4 | 233300120320211232311123 |
5 | 210012141441132434001 |
6 | 2022412010320300135 |
7 | 62145262305231542 |
oct | 5760307045566533 |
9 | 1015600016318065 |
10 | 210033440124251 |
11 | 60a17755431697 |
12 | 1b681a7a17164b |
13 | 90270b7413573 |
14 | 39c195c011159 |
15 | 19436b9b3c2bb |
hex | bf063896ed5b |
210033440124251 has 8 divisors (see below), whose sum is σ = 222394463126784. Its totient is φ = 197673096539520.
The previous prime is 210033440124181. The next prime is 210033440124257. The reversal of 210033440124251 is 152421044330012.
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 210033440124251 - 230 = 210032366382427 is a prime.
It is a super-2 number, since 2×2100334401242512 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210033440124257) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 169217915 + ... + 170454596.
It is an arithmetic number, because the mean of its divisors is an integer number (27799307890848).
Almost surely, 2210033440124251 is an apocalyptic number.
210033440124251 is a deficient number, since it is larger than the sum of its proper divisors (12361023002533).
210033440124251 is a wasteful number, since it uses less digits than its factorization.
210033440124251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339708901.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 210033440124251 its reverse (152421044330012), we get a palindrome (362454484454263).
The spelling of 210033440124251 in words is "two hundred ten trillion, thirty-three billion, four hundred forty million, one hundred twenty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •