Base | Representation |
---|---|
bin | 11110000000111100100… |
… | …10001000010011010011 |
3 | 10122120222002022100112201 |
4 | 33000132102020103103 |
5 | 113344100324020430 |
6 | 2105434530504031 |
7 | 134336403143044 |
oct | 17003622102323 |
9 | 3576862270481 |
10 | 1031300220115 |
11 | 3684100a7600 |
12 | 147a58435017 |
13 | 76335b44b49 |
14 | 37cb542c8cb |
15 | 1bc5e5c58ca |
hex | f01e4884d3 |
1031300220115 has 48 divisors (see below), whose sum is σ = 1419845624064. Its totient is φ = 717219581760.
The previous prime is 1031300220101. The next prime is 1031300220143. The reversal of 1031300220115 is 5110220031301.
It is not a de Polignac number, because 1031300220115 - 29 = 1031300219603 is a prime.
It is a super-2 number, since 2×10313002201152 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1031300220092 and 1031300220101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 60702652 + ... + 60719638.
It is an arithmetic number, because the mean of its divisors is an integer number (29580117168).
Almost surely, 21031300220115 is an apocalyptic number.
1031300220115 is a deficient number, since it is larger than the sum of its proper divisors (388545403949).
1031300220115 is a wasteful number, since it uses less digits than its factorization.
1031300220115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21400 (or 21389 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 19.
Adding to 1031300220115 its reverse (5110220031301), we get a palindrome (6141520251416).
The spelling of 1031300220115 in words is "one trillion, thirty-one billion, three hundred million, two hundred twenty thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •