Base | Representation |
---|---|
bin | 1001010111101011001011… |
… | …0010101100100110000001 |
3 | 1100110220010011202000122210 |
4 | 2111322302302230212001 |
5 | 2322243133242210423 |
6 | 33524454200052333 |
7 | 2112214241256615 |
oct | 225726262544601 |
9 | 40426104660583 |
10 | 10302331210113 |
11 | 3312215428a48 |
12 | 11a47b1a640a9 |
13 | 599675c38ca7 |
14 | 2788c7b05345 |
15 | 12cec20dab93 |
hex | 95eb2cac981 |
10302331210113 has 32 divisors (see below), whose sum is σ = 14635441497600. Its totient is φ = 6427541828736.
The previous prime is 10302331210111. The next prime is 10302331210163. The reversal of 10302331210113 is 31101213320301.
It is a happy number.
It is not a de Polignac number, because 10302331210113 - 21 = 10302331210111 is a prime.
It is a super-2 number, since 2×103023312101132 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10302331210113.
It is not an unprimeable number, because it can be changed into a prime (10302331210111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39121878 + ... + 39384336.
It is an arithmetic number, because the mean of its divisors is an integer number (457357546800).
Almost surely, 210302331210113 is an apocalyptic number.
It is an amenable number.
10302331210113 is a deficient number, since it is larger than the sum of its proper divisors (4333110287487).
10302331210113 is a wasteful number, since it uses less digits than its factorization.
10302331210113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270861.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10302331210113 its reverse (31101213320301), we get a palindrome (41403544530414).
The spelling of 10302331210113 in words is "ten trillion, three hundred two billion, three hundred thirty-one million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •