Base | Representation |
---|---|
bin | 11011111110000011000111… |
… | …011111101010010010111011 |
3 | 121010112202102202020201201120 |
4 | 123332003013133222102323 |
5 | 112110403424320320011 |
6 | 1113342323032320323 |
7 | 34624160315465124 |
oct | 3376030737522273 |
9 | 533482382221646 |
10 | 123011210323131 |
11 | 36216841371649 |
12 | 119684915430a3 |
13 | 5383ba4614170 |
14 | 2253abab4504b |
15 | e34c0d131a06 |
hex | 6fe0c77ea4bb |
123011210323131 has 16 divisors (see below), whose sum is σ = 176691094035456. Its totient is φ = 75673658118816.
The previous prime is 123011210323103. The next prime is 123011210323201. The reversal of 123011210323131 is 131323012110321.
It is not a de Polignac number, because 123011210323131 - 29 = 123011210322619 is a prime.
It is a super-2 number, since 2×1230112103231312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (123011210323031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 532137835 + ... + 532368948.
It is an arithmetic number, because the mean of its divisors is an integer number (11043193377216).
Almost surely, 2123011210323131 is an apocalyptic number.
123011210323131 is a deficient number, since it is larger than the sum of its proper divisors (53679883712325).
123011210323131 is a wasteful number, since it uses less digits than its factorization.
123011210323131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064509762.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 123011210323131 its reverse (131323012110321), we get a palindrome (254334222433452).
The spelling of 123011210323131 in words is "one hundred twenty-three trillion, eleven billion, two hundred ten million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •