Base | Representation |
---|---|
bin | 101101100011001000100… |
… | …100001010000111101010 |
3 | 102002020100010110121110210 |
4 | 231203020210022013222 |
5 | 402240421341111242 |
6 | 10353540521521550 |
7 | 442066552321341 |
oct | 55431044120752 |
9 | 12066303417423 |
10 | 3130101113322 |
11 | aa7517527837 |
12 | 4267746432b6 |
13 | 199223647bb1 |
14 | ab6d79a2b58 |
15 | 5664b3cbd9c |
hex | 2d8c890a1ea |
3130101113322 has 8 divisors (see below), whose sum is σ = 6260202226656. Its totient is φ = 1043367037772.
The previous prime is 3130101113299. The next prime is 3130101113327. The reversal of 3130101113322 is 2233111010313.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
3130101113322 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (3130101113327) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 260841759438 + ... + 260841759449.
It is an arithmetic number, because the mean of its divisors is an integer number (782525278332).
Almost surely, 23130101113322 is an apocalyptic number.
3130101113322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3130101113322 is a wasteful number, since it uses less digits than its factorization.
3130101113322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 521683518892.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 3130101113322 its reverse (2233111010313), we get a palindrome (5363212123635).
It can be divided in two parts, 3130101 and 113322, that added together give a palindrome (3243423).
The spelling of 3130101113322 in words is "three trillion, one hundred thirty billion, one hundred one million, one hundred thirteen thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •