Base | Representation |
---|---|
bin | 1101101100000101100101… |
… | …10101010100001010000100 |
3 | 10221120201212021102202220001 |
4 | 12312002302311110022010 |
5 | 12421143131032143022 |
6 | 144004421135451044 |
7 | 6224543604600523 |
oct | 666026265241204 |
9 | 127521767382801 |
10 | 30102131131012 |
11 | 9656273298456 |
12 | 3461bb2986a84 |
13 | 13a4807619555 |
14 | 760d4547c4ba |
15 | 37305b179b27 |
hex | 1b60b2d54284 |
30102131131012 has 24 divisors (see below), whose sum is σ = 54969301227456. Its totient is φ = 14396621071008.
The previous prime is 30102131131001. The next prime is 30102131131067. The reversal of 30102131131012 is 21013113120103.
It is a super-3 number, since 3×301021311310123 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 51812838 + ... + 52390594.
It is an arithmetic number, because the mean of its divisors is an integer number (2290387551144).
Almost surely, 230102131131012 is an apocalyptic number.
It is an amenable number.
30102131131012 is a deficient number, since it is larger than the sum of its proper divisors (24867170096444).
30102131131012 is a wasteful number, since it uses less digits than its factorization.
30102131131012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1144107 (or 1144105 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 30102131131012 its reverse (21013113120103), we get a palindrome (51115244251115).
It can be divided in two parts, 3010213 and 1131012, that added together give a square (4141225 = 20352).
The spelling of 30102131131012 in words is "thirty trillion, one hundred two billion, one hundred thirty-one million, one hundred thirty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •