Base | Representation |
---|---|
bin | 110101001111000110… |
… | …0011001111111101110 |
3 | 101221002101021101122210 |
4 | 1222132030121333232 |
5 | 3333113214431110 |
6 | 124304102551250 |
7 | 11155015120002 |
oct | 1523614317756 |
9 | 357071241583 |
10 | 114323202030 |
11 | 44536515854 |
12 | 1a1a6738526 |
13 | aa1c08110b |
14 | 576742a702 |
15 | 2e91911520 |
hex | 1a9e319fee |
114323202030 has 16 divisors (see below), whose sum is σ = 274375684944. Its totient is φ = 30486187200.
The previous prime is 114323202017. The next prime is 114323202079. The reversal of 114323202030 is 30202323411.
It is a super-2 number, since 2×1143232020302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114323201988 and 114323202006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1905386671 + ... + 1905386730.
It is an arithmetic number, because the mean of its divisors is an integer number (17148480309).
Almost surely, 2114323202030 is an apocalyptic number.
114323202030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114323202030 is an abundant number, since it is smaller than the sum of its proper divisors (160052482914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114323202030 is a wasteful number, since it uses less digits than its factorization.
114323202030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3810773411.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 114323202030 its reverse (30202323411), we get a palindrome (144525525441).
The spelling of 114323202030 in words is "one hundred fourteen billion, three hundred twenty-three million, two hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •