Base | Representation |
---|---|
bin | 10111010000101011001111… |
… | …100011000010000000111011 |
3 | 111102012212210111110101122211 |
4 | 113100223033203002000323 |
5 | 101402044433324420011 |
6 | 1001324234151355551 |
7 | 30356001321031504 |
oct | 2720531743020073 |
9 | 442185714411584 |
10 | 102301013123131 |
11 | 2a661685a206a9 |
12 | b582756382bb7 |
13 | 4510c3738c354 |
14 | 1b395771a9bab |
15 | bc613dd80b21 |
hex | 5d0acf8c203b |
102301013123131 has 4 divisors (see below), whose sum is σ = 102301033494592. Its totient is φ = 102300992751672.
The previous prime is 102301013123107. The next prime is 102301013123137. The reversal of 102301013123131 is 131321310103201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102301013123131 - 231 = 102298865639483 is a prime.
It is a super-2 number, since 2×1023010131231312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102301013123137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3287821 + ... + 14676913.
It is an arithmetic number, because the mean of its divisors is an integer number (25575258373648).
Almost surely, 2102301013123131 is an apocalyptic number.
102301013123131 is a deficient number, since it is larger than the sum of its proper divisors (20371461).
102301013123131 is an equidigital number, since it uses as much as digits as its factorization.
102301013123131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20371460.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 102301013123131 its reverse (131321310103201), we get a palindrome (233622323226332).
The spelling of 102301013123131 in words is "one hundred two trillion, three hundred one billion, thirteen million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •