Base | Representation |
---|---|
bin | 1011111100010001001000… |
… | …1100100101010000101110 |
3 | 1201111012212200122201212200 |
4 | 2333010102030211100232 |
5 | 3210110240144441420 |
6 | 43531503103042330 |
7 | 2523420100124622 |
oct | 277042214452056 |
9 | 51435780581780 |
10 | 13130020312110 |
11 | 4202457192699 |
12 | 15808292a03a6 |
13 | 743203b22440 |
14 | 3356d409b182 |
15 | 17b81e1adb90 |
hex | bf11232542e |
13130020312110 has 96 divisors (see below), whose sum is σ = 37128057771168. Its totient is φ = 3200004921600.
The previous prime is 13130020312109. The next prime is 13130020312151. The reversal of 13130020312110 is 1121302003131.
13130020312110 is a `hidden beast` number, since 1 + 31 + 300 + 20 + 312 + 1 + 1 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 55437472 + ... + 55673811.
It is an arithmetic number, because the mean of its divisors is an integer number (386750601783).
Almost surely, 213130020312110 is an apocalyptic number.
13130020312110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13130020312110 is an abundant number, since it is smaller than the sum of its proper divisors (23998037459058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130020312110 is a wasteful number, since it uses less digits than its factorization.
13130020312110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111111410 (or 111111407 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 13130020312110 its reverse (1121302003131), we get a palindrome (14251322315241).
The spelling of 13130020312110 in words is "thirteen trillion, one hundred thirty billion, twenty million, three hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •