Base | Representation |
---|---|
bin | 11100000010000110… |
… | …110011101111110011 |
3 | 2212200201200000220212 |
4 | 130002012303233303 |
5 | 443121112012243 |
6 | 21454445454335 |
7 | 2113623500453 |
oct | 340206635763 |
9 | 85621600825 |
10 | 30100110323 |
11 | 11846800438 |
12 | 5a005713ab |
13 | 2ab9046b8a |
14 | 1657867d63 |
15 | bb2801318 |
hex | 7021b3bf3 |
30100110323 has 4 divisors (see below), whose sum is σ = 30124723248. Its totient is φ = 30075497400.
The previous prime is 30100110319. The next prime is 30100110371. The reversal of 30100110323 is 32301100103.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32301100103 = 47 ⋅687257449.
It is a cyclic number.
It is not a de Polignac number, because 30100110323 - 22 = 30100110319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30100110298 and 30100110307.
It is not an unprimeable number, because it can be changed into a prime (30100110823) 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 3 ways as a sum of consecutive naturals, for example, 12304628 + ... + 12307073.
It is an arithmetic number, because the mean of its divisors is an integer number (7531180812).
Almost surely, 230100110323 is an apocalyptic number.
30100110323 is a deficient number, since it is larger than the sum of its proper divisors (24612925).
30100110323 is a wasteful number, since it uses less digits than its factorization.
30100110323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24612924.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 30100110323 its reverse (32301100103), we get a palindrome (62401210426).
The spelling of 30100110323 in words is "thirty billion, one hundred million, one hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •