Base | Representation |
---|---|
bin | 11100000010001111… |
… | …001111001110100000 |
3 | 2212200212211022001221 |
4 | 130002033033032200 |
5 | 443122143220112 |
6 | 21455005104424 |
7 | 2113651332661 |
oct | 340217171640 |
9 | 85625738057 |
10 | 30102320032 |
11 | 11847a7a644 |
12 | 5a01258114 |
13 | 2ab963b8b5 |
14 | 1657c81368 |
15 | bb2adae07 |
hex | 7023cf3a0 |
30102320032 has 12 divisors (see below), whose sum is σ = 59263942626. Its totient is φ = 15051160000.
The previous prime is 30102319999. The next prime is 30102320033. The reversal of 30102320032 is 23002320103.
It can be written as a sum of positive squares in only one way, i.e., 26128782736 + 3973537296 = 161644^2 + 63036^2 .
It is a super-2 number, since 2×301023200322 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 30102319988 and 30102320015.
It is not an unprimeable number, because it can be changed into a prime (30102320033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 470348719 + ... + 470348782.
Almost surely, 230102320032 is an apocalyptic number.
30102320032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30102320032 is a deficient number, since it is larger than the sum of its proper divisors (29161622594).
30102320032 is an equidigital number, since it uses as much as digits as its factorization.
30102320032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 940697511 (or 940697503 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 30102320032 its reverse (23002320103), we get a palindrome (53104640135).
The spelling of 30102320032 in words is "thirty billion, one hundred two million, three hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •