Base | Representation |
---|---|
bin | 101111000010011001… |
… | …0010000000010110001 |
3 | 100122201200220221102022 |
4 | 1132010302100002301 |
5 | 3123333033410413 |
6 | 114223154001225 |
7 | 10204112642255 |
oct | 1360462200261 |
9 | 318650827368 |
10 | 101012013233 |
11 | 3992571467a |
12 | 176b0876215 |
13 | 96aa394941 |
14 | 4c63618265 |
15 | 2962ee0608 |
hex | 1784c900b1 |
101012013233 has 2 divisors, whose sum is σ = 101012013234. Its totient is φ = 101012013232.
The previous prime is 101012013229. The next prime is 101012013287. The reversal of 101012013233 is 332310210101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78281324944 + 22730688289 = 279788^2 + 150767^2 .
It is an emirp because it is prime and its reverse (332310210101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101012013233 - 22 = 101012013229 is a prime.
It is a super-2 number, since 2×1010120132332 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101012003233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50506006616 + 50506006617.
It is an arithmetic number, because the mean of its divisors is an integer number (50506006617).
Almost surely, 2101012013233 is an apocalyptic number.
It is an amenable number.
101012013233 is a deficient number, since it is larger than the sum of its proper divisors (1).
101012013233 is an equidigital number, since it uses as much as digits as its factorization.
101012013233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 101012013233 its reverse (332310210101), we get a palindrome (433322223334).
The spelling of 101012013233 in words is "one hundred one billion, twelve million, thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •