Base | Representation |
---|---|
bin | 100101101001110011100101… |
… | …0011110101000001100010101 |
3 | 1121102200112012210102002001010 |
4 | 1023103213022132220030111 |
5 | 321402400034242414104 |
6 | 3132223422505122433 |
7 | 126522332511561651 |
oct | 11323471236501425 |
9 | 1542615183362033 |
10 | 331201210123029 |
11 | 9659270a797a44 |
12 | 3119101b189419 |
13 | 112a61a8a58a9c |
14 | 5bb031cd13a61 |
15 | 28454846ad489 |
hex | 12d39ca7a8315 |
331201210123029 has 16 divisors (see below), whose sum is σ = 441642348150080. Its totient is φ = 220780440374400.
The previous prime is 331201210122997. The next prime is 331201210123031. The reversal of 331201210123029 is 920321012102133.
It is not a de Polignac number, because 331201210123029 - 25 = 331201210122997 is a prime.
It is a super-2 number, since 2×3312012101230292 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 331201210122987 and 331201210123005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331201210123129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1774652082 + ... + 1774838700.
It is an arithmetic number, because the mean of its divisors is an integer number (27602646759380).
Almost surely, 2331201210123029 is an apocalyptic number.
It is an amenable number.
331201210123029 is a deficient number, since it is larger than the sum of its proper divisors (110441138027051).
331201210123029 is a wasteful number, since it uses less digits than its factorization.
331201210123029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238020.
The product of its (nonzero) digits is 3888, while the sum is 30.
The spelling of 331201210123029 in words is "three hundred thirty-one trillion, two hundred one billion, two hundred ten million, one hundred twenty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •