Base | Representation |
---|---|
bin | 11011111111010101111010… |
… | …011101011110111101111111 |
3 | 121010212020220110212000120201 |
4 | 123333111322131132331333 |
5 | 112113333012212020111 |
6 | 1113451224424424331 |
7 | 34633455352235662 |
oct | 3377257235367577 |
9 | 533766813760521 |
10 | 123100112220031 |
11 | 36250512153611 |
12 | 119817626180a7 |
13 | 538c3a1a9ac9b |
14 | 2258111c796d9 |
15 | e371b2d9e6c1 |
hex | 6ff57a75ef7f |
123100112220031 has 2 divisors, whose sum is σ = 123100112220032. Its totient is φ = 123100112220030.
The previous prime is 123100112219879. The next prime is 123100112220061. The reversal of 123100112220031 is 130022211001321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123100112220031 - 211 = 123100112217983 is a prime.
It is a super-2 number, since 2×1231001122200312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123100112219990 and 123100112220008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123100112220061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61550056110015 + 61550056110016.
It is an arithmetic number, because the mean of its divisors is an integer number (61550056110016).
Almost surely, 2123100112220031 is an apocalyptic number.
123100112220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
123100112220031 is an equidigital number, since it uses as much as digits as its factorization.
123100112220031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 123100112220031 its reverse (130022211001321), we get a palindrome (253122323221352).
The spelling of 123100112220031 in words is "one hundred twenty-three trillion, one hundred billion, one hundred twelve million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •