Base | Representation |
---|---|
bin | 11100001001111010… |
… | …100010011110110011 |
3 | 2220000212011120220010 |
4 | 130021322202132303 |
5 | 443403131032403 |
6 | 21515445350003 |
7 | 2120104131420 |
oct | 341172423663 |
9 | 86025146803 |
10 | 30231111603 |
11 | 11903746660 |
12 | 5a38408303 |
13 | 2b0a223324 |
14 | 166b008d47 |
15 | bbe07b603 |
hex | 709ea27b3 |
30231111603 has 32 divisors (see below), whose sum is σ = 52899287040. Its totient is φ = 14877920160.
The previous prime is 30231111583. The next prime is 30231111661. The reversal of 30231111603 is 30611113203.
It is not a de Polignac number, because 30231111603 - 218 = 30230849459 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 30231111603.
It is not an unprimeable number, because it can be changed into a prime (30231119603) 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 31 ways as a sum of consecutive naturals, for example, 3439575 + ... + 3448352.
It is an arithmetic number, because the mean of its divisors is an integer number (1653102720).
Almost surely, 230231111603 is an apocalyptic number.
30231111603 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
30231111603 is a deficient number, since it is larger than the sum of its proper divisors (22668175437).
30231111603 is a wasteful number, since it uses less digits than its factorization.
30231111603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6887967.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 30231111603 its reverse (30611113203), we get a palindrome (60842224806).
The spelling of 30231111603 in words is "thirty billion, two hundred thirty-one million, one hundred eleven thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •