Base | Representation |
---|---|
bin | 101101100011010101101… |
… | …011011001000010000111 |
3 | 102002020220110102202121021 |
4 | 231203111223121002013 |
5 | 402241344201110343 |
6 | 10354014421132011 |
7 | 442105163304433 |
oct | 55432553310207 |
9 | 12066813382537 |
10 | 3130321113223 |
11 | aa761a72aa37 |
12 | 42681625a007 |
13 | 19925a0b5555 |
14 | ab718cad9c3 |
15 | 566608870ed |
hex | 2d8d5ad9087 |
3130321113223 has 8 divisors (see below), whose sum is σ = 3146064734592. Its totient is φ = 3114616127736.
The previous prime is 3130321113203. The next prime is 3130321113229. The reversal of 3130321113223 is 3223111230313.
3130321113223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3130321113223 - 213 = 3130321105031 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 (3130321113229) 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, 9496515 + ... + 9820612.
It is an arithmetic number, because the mean of its divisors is an integer number (393258091824).
Almost surely, 23130321113223 is an apocalyptic number.
3130321113223 is a deficient number, since it is larger than the sum of its proper divisors (15743621369).
3130321113223 is a wasteful number, since it uses less digits than its factorization.
3130321113223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19317941.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 3130321113223 its reverse (3223111230313), we get a palindrome (6353432343536).
The spelling of 3130321113223 in words is "three trillion, one hundred thirty billion, three hundred twenty-one million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •