Base | Representation |
---|---|
bin | 11100000000110011111001… |
… | …000010111011011100001000 |
3 | 121011012220100221001012000122 |
4 | 130000303321002323130020 |
5 | 112122011142133304000 |
6 | 1114005433425122412 |
7 | 34643660063103212 |
oct | 3400637102733410 |
9 | 534186327035018 |
10 | 123201020213000 |
11 | 3628a294080224 |
12 | 11999224489408 |
13 | 5398a63742272 |
14 | 225cd657375b2 |
15 | e39b1bb94085 |
hex | 700cf90bb708 |
123201020213000 has 64 divisors (see below), whose sum is σ = 288311140793520. Its totient is φ = 49276860480000.
The previous prime is 123201020212997. The next prime is 123201020213039. The reversal of 123201020213000 is 312020102321.
It can be written as a sum of positive squares in 8 ways, for example, as 77895693604 + 123123124519396 = 279098^2 + 11096086^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 123201020213000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9485450 + ... + 18340550.
Almost surely, 2123201020213000 is an apocalyptic number.
123201020213000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123201020213000 is an abundant number, since it is smaller than the sum of its proper divisors (165110120580520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123201020213000 is a wasteful number, since it uses less digits than its factorization.
123201020213000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8869035 (or 8869021 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 123201020213000 its reverse (312020102321), we get a palindrome (123513040315321).
The spelling of 123201020213000 in words is "one hundred twenty-three trillion, two hundred one billion, twenty million, two hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •