Base | Representation |
---|---|
bin | 1101101100111001100010… |
… | …10001011010110010110111 |
3 | 10221200101212001110110121120 |
4 | 12312130301101122302313 |
5 | 12422122241142344343 |
6 | 144025312514515023 |
7 | 6226552016204505 |
oct | 666346121326267 |
9 | 127611761413546 |
10 | 30130022231223 |
11 | 96670860748a2 |
12 | 3467497595a73 |
13 | 13a7330ac8945 |
14 | 76242d7a1675 |
15 | 373b3ea7e683 |
hex | 1b673145acb7 |
30130022231223 has 4 divisors (see below), whose sum is σ = 40173362974968. Its totient is φ = 20086681487480.
The previous prime is 30130022231219. The next prime is 30130022231261. The reversal of 30130022231223 is 32213222003103.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30130022231223 - 22 = 30130022231219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30130022231193 and 30130022231202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30130022231203) 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, 5021670371868 + ... + 5021670371873.
It is an arithmetic number, because the mean of its divisors is an integer number (10043340743742).
Almost surely, 230130022231223 is an apocalyptic number.
30130022231223 is a deficient number, since it is larger than the sum of its proper divisors (10043340743745).
30130022231223 is a wasteful number, since it uses less digits than its factorization.
30130022231223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10043340743744.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 30130022231223 its reverse (32213222003103), we get a palindrome (62343244234326).
The spelling of 30130022231223 in words is "thirty trillion, one hundred thirty billion, twenty-two million, two hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •