Base | Representation |
---|---|
bin | 11110000000111100101… |
… | …01111101001100101101 |
3 | 10122120222011012022112111 |
4 | 33000132111331030231 |
5 | 113344101103120323 |
6 | 2105435004204021 |
7 | 134336414521402 |
oct | 17003625751455 |
9 | 3576864168474 |
10 | 1031301223213 |
11 | 368410722208 |
12 | 147a58839611 |
13 | 763361065b1 |
14 | 37cb56102a9 |
15 | 1bc5e722c0d |
hex | f01e57d32d |
1031301223213 has 8 divisors (see below), whose sum is σ = 1033165961856. Its totient is φ = 1029436980000.
The previous prime is 1031301223207. The next prime is 1031301223261. The reversal of 1031301223213 is 3123221031301.
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 1031301223213 - 29 = 1031301222701 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 (1031301223313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4177770 + ... + 4417732.
It is an arithmetic number, because the mean of its divisors is an integer number (129145745232).
Almost surely, 21031301223213 is an apocalyptic number.
It is an amenable number.
1031301223213 is a deficient number, since it is larger than the sum of its proper divisors (1864738643).
1031301223213 is an equidigital number, since it uses as much as digits as its factorization.
1031301223213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247715.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1031301223213 its reverse (3123221031301), we get a palindrome (4154522254514).
It can be divided in two parts, 10313012 and 23213, that added together give a square (10336225 = 32152).
The spelling of 1031301223213 in words is "one trillion, thirty-one billion, three hundred one million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •