Base | Representation |
---|---|
bin | 11100000010001011… |
… | …011011110111010111 |
3 | 2212200210221122201002 |
4 | 130002023123313113 |
5 | 443121414320343 |
6 | 21454531453515 |
7 | 2113640011556 |
oct | 340213336727 |
9 | 85623848632 |
10 | 30101323223 |
11 | 11847459734 |
12 | 5a00a5729b |
13 | 2ab937cc7a |
14 | 1657aa1d9d |
15 | bb29908b8 |
hex | 7022dbdd7 |
30101323223 has 8 divisors (see below), whose sum is σ = 30205094400. Its totient is φ = 29997663448.
The previous prime is 30101323199. The next prime is 30101323247. The reversal of 30101323223 is 32232310103.
It is an interprime number because it is at equal distance from previous prime (30101323199) and next prime (30101323247).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30101323223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30101323195 and 30101323204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30101323123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 532790 + ... + 586572.
It is an arithmetic number, because the mean of its divisors is an integer number (3775636800).
Almost surely, 230101323223 is an apocalyptic number.
30101323223 is a deficient number, since it is larger than the sum of its proper divisors (103771177).
30101323223 is a wasteful number, since it uses less digits than its factorization.
30101323223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55701.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30101323223 its reverse (32232310103), we get a palindrome (62333633326).
The spelling of 30101323223 in words is "thirty billion, one hundred one million, three hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •