Base | Representation |
---|---|
bin | 10111001110000101011111… |
… | …100001100110010111011101 |
3 | 111101120212102020201001012121 |
4 | 113032011133201212113131 |
5 | 101341140441222243123 |
6 | 1001110402114502541 |
7 | 30340101063552310 |
oct | 2716053741462735 |
9 | 441525366631177 |
10 | 102123040040413 |
11 | 2a5a3157840477 |
12 | b554167594a51 |
13 | 44ca213657c52 |
14 | 1b30ad2674977 |
15 | bc16c45a575d |
hex | 5ce15f8665dd |
102123040040413 has 4 divisors (see below), whose sum is σ = 116712045760480. Its totient is φ = 87534034320348.
The previous prime is 102123040040339. The next prime is 102123040040419. The reversal of 102123040040413 is 314040040321201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-102123040040413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102123040040419) 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, 7294502860023 + ... + 7294502860036.
It is an arithmetic number, because the mean of its divisors is an integer number (29178011440120).
Almost surely, 2102123040040413 is an apocalyptic number.
It is an amenable number.
102123040040413 is a deficient number, since it is larger than the sum of its proper divisors (14589005720067).
102123040040413 is an equidigital number, since it uses as much as digits as its factorization.
102123040040413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14589005720066.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 102123040040413 its reverse (314040040321201), we get a palindrome (416163080361614).
The spelling of 102123040040413 in words is "one hundred two trillion, one hundred twenty-three billion, forty million, forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •