Base | Representation |
---|---|
bin | 11000011100011010… |
… | …11011001011101011 |
3 | 1020212120210211011210 |
4 | 30032031123023223 |
5 | 203334031131443 |
6 | 10010113524203 |
7 | 643131141021 |
oct | 141615331353 |
9 | 36776724153 |
10 | 13123302123 |
11 | 5624842138 |
12 | 2662b73663 |
13 | 1311ab3939 |
14 | 8c6ca4711 |
15 | 51c1aac33 |
hex | 30e35b2eb |
13123302123 has 8 divisors (see below), whose sum is σ = 17595489600. Its totient is φ = 8699991368.
The previous prime is 13123302107. The next prime is 13123302151. The reversal of 13123302123 is 32120332131.
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 13123302123 - 24 = 13123302107 is a prime.
It is a super-2 number, since 2×131233021232 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13123302123.
It is not an unprimeable number, because it can be changed into a prime (13123302193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12218553 + ... + 12219626.
It is an arithmetic number, because the mean of its divisors is an integer number (2199436200).
Almost surely, 213123302123 is an apocalyptic number.
13123302123 is a deficient number, since it is larger than the sum of its proper divisors (4472187477).
13123302123 is a wasteful number, since it uses less digits than its factorization.
13123302123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24438361.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13123302123 its reverse (32120332131), we get a palindrome (45243634254).
The spelling of 13123302123 in words is "thirteen billion, one hundred twenty-three million, three hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •