Base | Representation |
---|---|
bin | 1011110101111110110110… |
… | …0010000110010011101100 |
3 | 1201002220010201201221201122 |
4 | 2331133231202012103230 |
5 | 3201323104414404400 |
6 | 43410123301400112 |
7 | 2512545032205314 |
oct | 275375542062354 |
9 | 51086121657648 |
10 | 13022031013100 |
11 | 4170681028a3a |
12 | 156390ba09038 |
13 | 735c84078545 |
14 | 3303abd5a444 |
15 | 178aed88e685 |
hex | bd7ed8864ec |
13022031013100 has 36 divisors (see below), whose sum is σ = 29920031261064. Its totient is φ = 4902411674880.
The previous prime is 13022031013087. The next prime is 13022031013157. The reversal of 13022031013100 is 131013022031.
It is a super-2 number, since 2×130220310131002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3830007422 + ... + 3830010821.
It is an arithmetic number, because the mean of its divisors is an integer number (831111979474).
Almost surely, 213022031013100 is an apocalyptic number.
13022031013100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13022031013100 is an abundant number, since it is smaller than the sum of its proper divisors (16898000247964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13022031013100 is a wasteful number, since it uses less digits than its factorization.
13022031013100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7660018274 (or 7660018267 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13022031013100 its reverse (131013022031), we get a palindrome (13153044035131).
The spelling of 13022031013100 in words is "thirteen trillion, twenty-two billion, thirty-one million, thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •