Base | Representation |
---|---|
bin | 111001010010100101… |
… | …0010010011111010011 |
3 | 102202120011200200102011 |
4 | 1302211022102133103 |
5 | 4003431141201344 |
6 | 132304052203351 |
7 | 11613540635035 |
oct | 1624512223723 |
9 | 382504620364 |
10 | 123030022099 |
11 | 481a4270616 |
12 | 1ba16609557 |
13 | b7a8b8095a |
14 | 5d51925c55 |
15 | 3300ec9d34 |
hex | 1ca52927d3 |
123030022099 has 8 divisors (see below), whose sum is σ = 130220788880. Its totient is φ = 115910805600.
The previous prime is 123030022079. The next prime is 123030022103. The reversal of 123030022099 is 990220030321.
It is a happy number.
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 123030022099 - 25 = 123030022067 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 123030022099.
It is not an unprimeable number, because it can be changed into a prime (123030022009) 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, 17884032 + ... + 17890909.
It is an arithmetic number, because the mean of its divisors is an integer number (16277598610).
Almost surely, 2123030022099 is an apocalyptic number.
123030022099 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
123030022099 is a deficient number, since it is larger than the sum of its proper divisors (7190766781).
123030022099 is a wasteful number, since it uses less digits than its factorization.
123030022099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35775141.
The product of its (nonzero) digits is 5832, while the sum is 31.
The spelling of 123030022099 in words is "one hundred twenty-three billion, thirty million, twenty-two thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •