Base | Representation |
---|---|
bin | 100011010000011111101100… |
… | …0010010010110101000001001 |
3 | 1111200002011121002021020012122 |
4 | 1012200333120102112220021 |
5 | 311122133410022412301 |
6 | 3015331524025221025 |
7 | 122216114512624625 |
oct | 10640773022265011 |
9 | 1450064532236178 |
10 | 310130332232201 |
11 | 8a8a9598511638 |
12 | 2a949404931775 |
13 | 1040821b209960 |
14 | 56825611d4185 |
15 | 25cc30588e81b |
hex | 11a0fd8496a09 |
310130332232201 has 8 divisors (see below), whose sum is σ = 335166675990720. Its totient is φ = 285262583381712.
The previous prime is 310130332232141. The next prime is 310130332232221. The reversal of 310130332232201 is 102232233031013.
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 310130332232201 - 26 = 310130332232137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (310130332232221) 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, 42148723181 + ... + 42148730538.
It is an arithmetic number, because the mean of its divisors is an integer number (41895834498840).
Almost surely, 2310130332232201 is an apocalyptic number.
It is an amenable number.
310130332232201 is a deficient number, since it is larger than the sum of its proper divisors (25036343758519).
310130332232201 is a wasteful number, since it uses less digits than its factorization.
310130332232201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84297454015.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 310130332232201 its reverse (102232233031013), we get a palindrome (412362565263214).
The spelling of 310130332232201 in words is "three hundred ten trillion, one hundred thirty billion, three hundred thirty-two million, two hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •