Base | Representation |
---|---|
bin | 11101011001110111100… |
… | …01000001001010100100 |
3 | 10120120210221100202200220 |
4 | 32230323301001022210 |
5 | 113023113411121012 |
6 | 2052045024204340 |
7 | 132664446322203 |
oct | 16547361011244 |
9 | 3516727322626 |
10 | 1010320020132 |
11 | 35a524348855 |
12 | 1439821696b0 |
13 | 74371373427 |
14 | 36c84cb123a |
15 | 1b43278a08c |
hex | eb3bc412a4 |
1010320020132 has 12 divisors (see below), whose sum is σ = 2357413380336. Its totient is φ = 336773340040.
The previous prime is 1010320020091. The next prime is 1010320020163. The reversal of 1010320020132 is 2310200230101.
It is a tau number, because it is divible by the number of its divisors (12).
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 3 ways as a sum of consecutive naturals, for example, 42096667494 + ... + 42096667517.
It is an arithmetic number, because the mean of its divisors is an integer number (196451115028).
Almost surely, 21010320020132 is an apocalyptic number.
1010320020132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010320020132 is an abundant number, since it is smaller than the sum of its proper divisors (1347093360204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010320020132 is a wasteful number, since it uses less digits than its factorization.
1010320020132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84193335018 (or 84193335016 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1010320020132 its reverse (2310200230101), we get a palindrome (3320520250233).
The spelling of 1010320020132 in words is "one trillion, ten billion, three hundred twenty million, twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •