Base | Representation |
---|---|
bin | 11011110000110101011000… |
… | …000001010100111101101000 |
3 | 121000022221110010020012120011 |
4 | 123300311120001110331220 |
5 | 112001014123103013000 |
6 | 1111405220215341304 |
7 | 34501441460221351 |
oct | 3360653001247550 |
9 | 530287403205504 |
10 | 122103102001000 |
11 | 359a66a894938a |
12 | 11840495981834 |
13 | 5319372049513 |
14 | 2221b70938d28 |
15 | e1b2add5e2ba |
hex | 6f0d58054f68 |
122103102001000 has 32 divisors (see below), whose sum is σ = 285721258684680. Its totient is φ = 48841240800000.
The previous prime is 122103102000961. The next prime is 122103102001033. The reversal of 122103102001000 is 100201301221.
It can be written as a sum of positive squares in 4 ways, for example, as 76590187502724 + 45512914498276 = 8751582^2 + 6746326^2 .
It is a super-2 number, since 2×1221031020010002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61051550001 + ... + 61051552000.
Almost surely, 2122103102001000 is an apocalyptic number.
122103102001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122103102001000 is an abundant number, since it is smaller than the sum of its proper divisors (163618156683680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122103102001000 is a wasteful number, since it uses less digits than its factorization.
122103102001000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122103102022 (or 122103102008 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 122103102001000 its reverse (100201301221), we get a palindrome (122203303302221).
The spelling of 122103102001000 in words is "one hundred twenty-two trillion, one hundred three billion, one hundred two million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •