Base | Representation |
---|---|
bin | 11011100100001000011100… |
… | …011000010001000001011011 |
3 | 120220020111101200102122101120 |
4 | 123210020130120101001123 |
5 | 111342213444043120443 |
6 | 1105500221241420323 |
7 | 34351410640261410 |
oct | 3344103430210133 |
9 | 526214350378346 |
10 | 121230223020123 |
11 | 3569a4a347a688 |
12 | 1171b29049a6a3 |
13 | 5284c65363a29 |
14 | 21d1807498107 |
15 | e03722820083 |
hex | 6e421c61105b |
121230223020123 has 64 divisors (see below), whose sum is σ = 197638983106560. Its totient is φ = 64519914240000.
The previous prime is 121230223020119. The next prime is 121230223020149. The reversal of 121230223020123 is 321020322032121.
It is not a de Polignac number, because 121230223020123 - 22 = 121230223020119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121230223020093 and 121230223020102.
It is not an unprimeable number, because it can be changed into a prime (121230223020113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 67660038 + ... + 69428676.
It is an arithmetic number, because the mean of its divisors is an integer number (3088109111040).
Almost surely, 2121230223020123 is an apocalyptic number.
121230223020123 is a deficient number, since it is larger than the sum of its proper divisors (76408760086437).
121230223020123 is a wasteful number, since it uses less digits than its factorization.
121230223020123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1770668.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 121230223020123 its reverse (321020322032121), we get a palindrome (442250545052244).
The spelling of 121230223020123 in words is "one hundred twenty-one trillion, two hundred thirty billion, two hundred twenty-three million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •