Base | Representation |
---|---|
bin | 111001010001101111… |
… | …1111001011000110101 |
3 | 102202111020012201102022 |
4 | 1302203133321120311 |
5 | 4003402021211041 |
6 | 132301214322525 |
7 | 11613051604616 |
oct | 1624337713065 |
9 | 382436181368 |
10 | 123002132021 |
11 | 4818a55136a |
12 | 1ba091b9445 |
13 | b7a3167152 |
14 | 5d4bd45c0d |
15 | 32ed81b24b |
hex | 1ca37f9635 |
123002132021 has 4 divisors (see below), whose sum is σ = 123265520352. Its totient is φ = 122738743692.
The previous prime is 123002131949. The next prime is 123002132087. The reversal of 123002132021 is 120231200321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 120231200321 = 103 ⋅1167293207.
It is a cyclic number.
It is not a de Polignac number, because 123002132021 - 222 = 122997937717 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123002132821) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 131693465 + ... + 131694398.
It is an arithmetic number, because the mean of its divisors is an integer number (30816380088).
Almost surely, 2123002132021 is an apocalyptic number.
It is an amenable number.
123002132021 is a deficient number, since it is larger than the sum of its proper divisors (263388331).
123002132021 is an equidigital number, since it uses as much as digits as its factorization.
123002132021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 263388330.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 123002132021 its reverse (120231200321), we get a palindrome (243233332342).
The spelling of 123002132021 in words is "one hundred twenty-three billion, two million, one hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •