Base | Representation |
---|---|
bin | 1001011000010011110000… |
… | …0000011011011101101111 |
3 | 1100111221020020222121122002 |
4 | 2112010330000123131233 |
5 | 2322432440121120101 |
6 | 33533455045442515 |
7 | 2113051166663642 |
oct | 226047400333557 |
9 | 40457206877562 |
10 | 10313223223151 |
11 | 33168a470a612 |
12 | 11a693171043b |
13 | 59a6c0684614 |
14 | 27923c505a59 |
15 | 12d40d448d6b |
hex | 9613c01b76f |
10313223223151 has 2 divisors, whose sum is σ = 10313223223152. Its totient is φ = 10313223223150.
The previous prime is 10313223223133. The next prime is 10313223223223. The reversal of 10313223223151 is 15132232231301.
10313223223151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10313223223151 is a prime.
It is a super-2 number, since 2×103132232231512 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10313223213151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156611611575 + 5156611611576.
It is an arithmetic number, because the mean of its divisors is an integer number (5156611611576).
Almost surely, 210313223223151 is an apocalyptic number.
10313223223151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10313223223151 is an equidigital number, since it uses as much as digits as its factorization.
10313223223151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 10313223223151 its reverse (15132232231301), we get a palindrome (25445455454452).
The spelling of 10313223223151 in words is "ten trillion, three hundred thirteen billion, two hundred twenty-three million, two hundred twenty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •