Base | Representation |
---|---|
bin | 1001001100101010010011… |
… | …1011010010101101011001 |
3 | 1022210210201201111201212021 |
4 | 2103022210323102231121 |
5 | 2311143132211140322 |
6 | 33301523031414441 |
7 | 2062435353561004 |
oct | 223124473225531 |
9 | 38723651451767 |
10 | 10113120021337 |
11 | 3249a4a670363 |
12 | 1173ba7524421 |
13 | 584880b704a8 |
14 | 26d69883c53b |
15 | 1280eaddb4c7 |
hex | 932a4ed2b59 |
10113120021337 has 2 divisors, whose sum is σ = 10113120021338. Its totient is φ = 10113120021336.
The previous prime is 10113120021281. The next prime is 10113120021427. The reversal of 10113120021337 is 73312002131101.
10113120021337 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 can be written as a sum of positive squares in only one way, i.e., 7639369851481 + 2473750169856 = 2763941^2 + 1572816^2 .
It is a cyclic number.
It is not a de Polignac number, because 10113120021337 - 219 = 10113119497049 is a prime.
It is not a weakly prime, because it can be changed into another prime (10113120021437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056560010668 + 5056560010669.
It is an arithmetic number, because the mean of its divisors is an integer number (5056560010669).
Almost surely, 210113120021337 is an apocalyptic number.
It is an amenable number.
10113120021337 is a deficient number, since it is larger than the sum of its proper divisors (1).
10113120021337 is an equidigital number, since it uses as much as digits as its factorization.
10113120021337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 10113120021337 its reverse (73312002131101), we get a palindrome (83425122152438).
The spelling of 10113120021337 in words is "ten trillion, one hundred thirteen billion, one hundred twenty million, twenty-one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •