Base | Representation |
---|---|
bin | 111001010001101101… |
… | …1100101000100010101 |
3 | 102202111011002012212111 |
4 | 1302203123211010111 |
5 | 4003401224001323 |
6 | 132301134151021 |
7 | 11613036152110 |
oct | 1624333450425 |
9 | 382434065774 |
10 | 123001000213 |
11 | 48189948a93 |
12 | 1ba08952471 |
13 | b7a2b5bc40 |
14 | 5d4bb2d577 |
15 | 32ed695c0d |
hex | 1ca36e5115 |
123001000213 has 16 divisors (see below), whose sum is σ = 151399624320. Its totient is φ = 97310615616.
The previous prime is 123001000193. The next prime is 123001000249. The reversal of 123001000213 is 312000100321.
It is a cyclic number.
It is not a de Polignac number, because 123001000213 - 29 = 123000999701 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 123001000193 and 123001000202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123001030213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1054518 + ... + 1165336.
It is an arithmetic number, because the mean of its divisors is an integer number (9462476520).
Almost surely, 2123001000213 is an apocalyptic number.
123001000213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
123001000213 is a deficient number, since it is larger than the sum of its proper divisors (28398624107).
123001000213 is a wasteful number, since it uses less digits than its factorization.
123001000213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123036.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 123001000213 its reverse (312000100321), we get a palindrome (435001100534).
The spelling of 123001000213 in words is "one hundred twenty-three billion, one million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •