Base | Representation |
---|---|
bin | 111000110100010011… |
… | …1001111100111010001 |
3 | 102122221101020200122102 |
4 | 1301220213033213101 |
5 | 3444341113433241 |
6 | 132015203450145 |
7 | 11546424415244 |
oct | 1615047174721 |
9 | 378841220572 |
10 | 122014202321 |
11 | 47822922140 |
12 | 1b792386955 |
13 | b676594c6b |
14 | 5c96a5b25b |
15 | 3291c2139b |
hex | 1c689cf9d1 |
122014202321 has 8 divisors (see below), whose sum is σ = 133303022784. Its totient is φ = 110758151920.
The previous prime is 122014202311. The next prime is 122014202347. The reversal of 122014202321 is 123202410221.
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 122014202321 - 210 = 122014201297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122014202293 and 122014202302.
It is not an unprimeable number, because it can be changed into a prime (122014202311) 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, 8184725 + ... + 8199618.
It is an arithmetic number, because the mean of its divisors is an integer number (16662877848).
Almost surely, 2122014202321 is an apocalyptic number.
122014202321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122014202321 is a deficient number, since it is larger than the sum of its proper divisors (11288820463).
122014202321 is a wasteful number, since it uses less digits than its factorization.
122014202321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16385031.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 122014202321 its reverse (123202410221), we get a palindrome (245216612542).
The spelling of 122014202321 in words is "one hundred twenty-two billion, fourteen million, two hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •