Base | Representation |
---|---|
bin | 11110000000011011010… |
… | …10001011110100010101 |
3 | 10122120020122111102022201 |
4 | 33000031222023310111 |
5 | 113343012424011201 |
6 | 2105351124524501 |
7 | 134326445364460 |
oct | 17001552136425 |
9 | 3576218442281 |
10 | 1031021313301 |
11 | 36828771a801 |
12 | 14799ab50731 |
13 | 762c0120c25 |
14 | 37c8a38a2d7 |
15 | 1bc44d81801 |
hex | f00da8bd15 |
1031021313301 has 8 divisors (see below), whose sum is σ = 1178556464384. Its totient is φ = 883547760240.
The previous prime is 1031021313253. The next prime is 1031021313307. The reversal of 1031021313301 is 1033131201301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1031021313301 - 211 = 1031021311253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031021313307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15363630 + ... + 15430591.
It is an arithmetic number, because the mean of its divisors is an integer number (147319558048).
Almost surely, 21031021313301 is an apocalyptic number.
It is an amenable number.
1031021313301 is a deficient number, since it is larger than the sum of its proper divisors (147535151083).
1031021313301 is an equidigital number, since it uses as much as digits as its factorization.
1031021313301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30799011.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1031021313301 its reverse (1033131201301), we get a palindrome (2064152514602).
The spelling of 1031021313301 in words is "one trillion, thirty-one billion, twenty-one million, three hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •