Base | Representation |
---|---|
bin | 101111110000000101000111… |
… | …111101111110001100110001 |
3 | 1000112120222020221011022022110 |
4 | 233300011013331332030301 |
5 | 210011320013131103101 |
6 | 2022354141122155533 |
7 | 62143611446216334 |
oct | 5760050775761461 |
9 | 1015528227138273 |
10 | 210012223300401 |
11 | 60a09758055925 |
12 | 1b6799387b2ba9 |
13 | 90250b5903922 |
14 | 39c090829a61b |
15 | 1942d77160cd6 |
hex | bf0147f7e331 |
210012223300401 has 4 divisors (see below), whose sum is σ = 280016297733872. Its totient is φ = 140008148866932.
The previous prime is 210012223300337. The next prime is 210012223300423. The reversal of 210012223300401 is 104003322210012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 210012223300401 - 26 = 210012223300337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210012223300471) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35002037216731 + ... + 35002037216736.
It is an arithmetic number, because the mean of its divisors is an integer number (70004074433468).
Almost surely, 2210012223300401 is an apocalyptic number.
It is an amenable number.
210012223300401 is a deficient number, since it is larger than the sum of its proper divisors (70004074433471).
210012223300401 is an equidigital number, since it uses as much as digits as its factorization.
210012223300401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70004074433470.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 210012223300401 its reverse (104003322210012), we get a palindrome (314015545510413).
The spelling of 210012223300401 in words is "two hundred ten trillion, twelve billion, two hundred twenty-three million, three hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •