Base | Representation |
---|---|
bin | 111001010010010100… |
… | …0101011010110010111 |
3 | 102202112120010000220022 |
4 | 1302210220223112113 |
5 | 4003421412223111 |
6 | 132303135255355 |
7 | 11613403016555 |
oct | 1624450532627 |
9 | 382476100808 |
10 | 123021211031 |
11 | 4819a2a2744 |
12 | 1ba1367a55b |
13 | b7a70b72c4 |
14 | 5d506b0bd5 |
15 | 33003392db |
hex | 1ca4a2b597 |
123021211031 has 8 divisors (see below), whose sum is σ = 124130732544. Its totient is φ = 121913890560.
The previous prime is 123021211003. The next prime is 123021211043. The reversal of 123021211031 is 130112120321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123021211031 is a prime.
It is a super-2 number, since 2×1230212110312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123021211091) 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, 437870 + ... + 661643.
It is an arithmetic number, because the mean of its divisors is an integer number (15516341568).
Almost surely, 2123021211031 is an apocalyptic number.
123021211031 is a deficient number, since it is larger than the sum of its proper divisors (1109521513).
123021211031 is a wasteful number, since it uses less digits than its factorization.
123021211031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100521.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 123021211031 its reverse (130112120321), we get a palindrome (253133331352).
The spelling of 123021211031 in words is "one hundred twenty-three billion, twenty-one million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •