Base | Representation |
---|---|
bin | 1101110101101010100100… |
… | …01100001010101100011011 |
3 | 10222202012022012100220110010 |
4 | 12322311102030022230123 |
5 | 12442041120341312103 |
6 | 144415524355453003 |
7 | 6260404024622364 |
oct | 672652214125433 |
9 | 128665265326403 |
10 | 30431222213403 |
11 | 9772899665500 |
12 | 34b59368b7163 |
13 | 13c986241387b |
14 | 772c4402ab6b |
15 | 37b8bc773903 |
hex | 1bad5230ab1b |
30431222213403 has 12 divisors (see below), whose sum is σ = 44598926219624. Its totient is φ = 18443164977600.
The previous prime is 30431222213401. The next prime is 30431222213407.
It is a happy number.
30431222213403 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 30431222213403 - 21 = 30431222213401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30431222213401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41916283678 + ... + 41916284403.
Almost surely, 230431222213403 is an apocalyptic number.
30431222213403 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
30431222213403 is a deficient number, since it is larger than the sum of its proper divisors (14167704006221).
30431222213403 is a wasteful number, since it uses less digits than its factorization.
30431222213403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83832568106 (or 83832568095 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 30.
It can be divided in two parts, 3043122 and 2213403, that added together give a palindrome (5256525).
The spelling of 30431222213403 in words is "thirty trillion, four hundred thirty-one billion, two hundred twenty-two million, two hundred thirteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •