Base | Representation |
---|---|
bin | 101111110001101010011011… |
… | …100101011000100011111001 |
3 | 1000112222101000210022121112010 |
4 | 233301222123211120203321 |
5 | 210020110302040321241 |
6 | 2022520131023240133 |
7 | 62154512160523053 |
oct | 5761523345304371 |
9 | 1015871023277463 |
10 | 210121000323321 |
11 | 60a508a792617a |
12 | 1b696a35a49049 |
13 | 903242c922b49 |
14 | 39c5ca6c8c8d3 |
15 | 1945ae1bced16 |
hex | bf1a9b9588f9 |
210121000323321 has 4 divisors (see below), whose sum is σ = 280161333764432. Its totient is φ = 140080666882212.
The previous prime is 210121000323263. The next prime is 210121000323341. The reversal of 210121000323321 is 123323000121012.
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 210121000323321 - 237 = 209983561369849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210121000323341) 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, 35020166720551 + ... + 35020166720556.
It is an arithmetic number, because the mean of its divisors is an integer number (70040333441108).
Almost surely, 2210121000323321 is an apocalyptic number.
It is an amenable number.
210121000323321 is a deficient number, since it is larger than the sum of its proper divisors (70040333441111).
210121000323321 is an equidigital number, since it uses as much as digits as its factorization.
210121000323321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70040333441110.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 210121000323321 its reverse (123323000121012), we get a palindrome (333444000444333).
The spelling of 210121000323321 in words is "two hundred ten trillion, one hundred twenty-one billion, three hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •