Base | Representation |
---|---|
bin | 111000110110111101… |
… | …0101111110111001110 |
3 | 102200011120201022012022 |
4 | 1301231322233313032 |
5 | 4000031404414410 |
6 | 132032103210142 |
7 | 11551555041263 |
oct | 1615572576716 |
9 | 380146638168 |
10 | 122103201230 |
11 | 4786908a35a |
12 | 1b7b8146952 |
13 | b68bb5633a |
14 | 5ca47c726a |
15 | 3299951455 |
hex | 1c6deafdce |
122103201230 has 8 divisors (see below), whose sum is σ = 219785762232. Its totient is φ = 48841280488.
The previous prime is 122103201211. The next prime is 122103201257. The reversal of 122103201230 is 32102301221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1221032012302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122103201199 and 122103201208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6105160052 + ... + 6105160071.
It is an arithmetic number, because the mean of its divisors is an integer number (27473220279).
Almost surely, 2122103201230 is an apocalyptic number.
122103201230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122103201230 is a deficient number, since it is larger than the sum of its proper divisors (97682561002).
122103201230 is a wasteful number, since it uses less digits than its factorization.
122103201230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12210320130.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 122103201230 its reverse (32102301221), we get a palindrome (154205502451).
Subtracting from 122103201230 its reverse (32102301221), we obtain a palindrome (90000900009).
The spelling of 122103201230 in words is "one hundred twenty-two billion, one hundred three million, two hundred one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •