Base | Representation |
---|---|
bin | 1011111100010010001110… |
… | …0010100111100010111110 |
3 | 1201111020121222012112000110 |
4 | 2333010203202213202332 |
5 | 3210111334143120220 |
6 | 43531552020010450 |
7 | 2523430232364630 |
oct | 277044342474276 |
9 | 51436558175013 |
10 | 13130311301310 |
11 | 4202596472135 |
12 | 15808aa830a26 |
13 | 74324c1b69b8 |
14 | 3357209a6a50 |
15 | 17b8399dcbe0 |
hex | bf1238a78be |
13130311301310 has 32 divisors (see below), whose sum is σ = 36014568141312. Its totient is φ = 3001214011680.
The previous prime is 13130311301309. The next prime is 13130311301363. The reversal of 13130311301310 is 1310311303131.
It is a super-2 number, since 2×131303113013102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31262645746 + ... + 31262646165.
It is an arithmetic number, because the mean of its divisors is an integer number (1125455254416).
Almost surely, 213130311301310 is an apocalyptic number.
13130311301310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13130311301310 is an abundant number, since it is smaller than the sum of its proper divisors (22884256840002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130311301310 is a wasteful number, since it uses less digits than its factorization.
13130311301310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62525291928.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 13130311301310 its reverse (1310311303131), we get a palindrome (14440622604441).
The spelling of 13130311301310 in words is "thirteen trillion, one hundred thirty billion, three hundred eleven million, three hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •