Base | Representation |
---|---|
bin | 101011110011011001110… |
… | …011010011101110010001 |
3 | 101122202200012221020020200 |
4 | 223303121303103232101 |
5 | 343304222042310301 |
6 | 10222500222325413 |
7 | 430321600101600 |
oct | 53633163235621 |
9 | 11582605836220 |
10 | 3010131213201 |
11 | a60653661152 |
12 | 407472a29869 |
13 | 18ab1476c108 |
14 | a5996653a37 |
15 | 53478dbec86 |
hex | 2bcd9cd3b91 |
3010131213201 has 36 divisors (see below), whose sum is σ = 5355359506692. Its totient is φ = 1618894093824.
The previous prime is 3010131213181. The next prime is 3010131213211. The reversal of 3010131213201 is 1023121310103.
3010131213201 is a `hidden beast` number, since 30 + 1 + 0 + 1 + 312 + 1 + 320 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1803176294976 + 1206954918225 = 1342824^2 + 1098615^2 .
It is not a de Polignac number, because 3010131213201 - 210 = 3010131212177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3010131213211) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 200748220 + ... + 200763213.
It is an arithmetic number, because the mean of its divisors is an integer number (148759986297).
Almost surely, 23010131213201 is an apocalyptic number.
It is an amenable number.
3010131213201 is a deficient number, since it is larger than the sum of its proper divisors (2345228293491).
3010131213201 is a wasteful number, since it uses less digits than its factorization.
3010131213201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401511470 (or 401511460 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 3010131213201 its reverse (1023121310103), we get a palindrome (4033252523304).
The spelling of 3010131213201 in words is "three trillion, ten billion, one hundred thirty-one million, two hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •