Base | Representation |
---|---|
bin | 11100000010001010… |
… | …100101111011110011 |
3 | 2212200210112102200121 |
4 | 130002022211323303 |
5 | 443121340233243 |
6 | 21454523031111 |
7 | 2113635101545 |
oct | 340212457363 |
9 | 85623472617 |
10 | 30101102323 |
11 | 11847318776 |
12 | 5a0096b497 |
13 | 2ab9303566 |
14 | 1657a45695 |
15 | bb294a1ed |
hex | 7022a5ef3 |
30101102323 has 4 divisors (see below), whose sum is σ = 30101507008. Its totient is φ = 30100697640.
The previous prime is 30101102321. The next prime is 30101102341. The reversal of 30101102323 is 32320110103.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32320110103 = 101641 ⋅317983.
It is a cyclic number.
It is not a de Polignac number, because 30101102323 - 21 = 30101102321 is a prime.
It is a super-2 number, since 2×301011023232 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30101102297 and 30101102306.
It is not an unprimeable number, because it can be changed into a prime (30101102321) 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, 55011 + ... + 251452.
It is an arithmetic number, because the mean of its divisors is an integer number (7525376752).
Almost surely, 230101102323 is an apocalyptic number.
30101102323 is a deficient number, since it is larger than the sum of its proper divisors (404685).
30101102323 is an equidigital number, since it uses as much as digits as its factorization.
30101102323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 404684.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 30101102323 its reverse (32320110103), we get a palindrome (62421212426).
The spelling of 30101102323 in words is "thirty billion, one hundred one million, one hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •