Base | Representation |
---|---|
bin | 1001011000010010111101… |
… | …1110111111011111010100 |
3 | 1100111220200121122211200110 |
4 | 2112010233132333133110 |
5 | 2322432022330144340 |
6 | 33533422142443020 |
7 | 2113043036145012 |
oct | 226045736773724 |
9 | 40456617584613 |
10 | 10313013131220 |
11 | 33167a7064418 |
12 | 11a6893293470 |
13 | 59a688ca5977 |
14 | 27921c6578b2 |
15 | 12d3e9c99680 |
hex | 9612f7bf7d4 |
10313013131220 has 24 divisors (see below), whose sum is σ = 28876436767584. Its totient is φ = 2750136834976.
The previous prime is 10313013131209. The next prime is 10313013131237. The reversal of 10313013131220 is 2213131031301.
It is a happy number.
It is a super-2 number, since 2×103130131312202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85941776034 + ... + 85941776153.
It is an arithmetic number, because the mean of its divisors is an integer number (1203184865316).
Almost surely, 210313013131220 is an apocalyptic number.
10313013131220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10313013131220 is an abundant number, since it is smaller than the sum of its proper divisors (18563423636364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10313013131220 is a wasteful number, since it uses less digits than its factorization.
10313013131220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171883552199 (or 171883552197 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10313013131220 its reverse (2213131031301), we get a palindrome (12526144162521).
The spelling of 10313013131220 in words is "ten trillion, three hundred thirteen billion, thirteen million, one hundred thirty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •