Base | Representation |
---|---|
bin | 10111001100010100001001… |
… | …000010101001100001100111 |
3 | 111101011020021001210111000222 |
4 | 113030110021002221201213 |
5 | 101332142210440031043 |
6 | 1000534433014154555 |
7 | 30325232021365244 |
oct | 2714241102514147 |
9 | 441136231714028 |
10 | 102001330002023 |
11 | 2a556580687191 |
12 | b53465b052a5b |
13 | 44bb8b80bb15a |
14 | 1b28c681925cb |
15 | bbd44e416d68 |
hex | 5cc5090a9867 |
102001330002023 has 4 divisors (see below), whose sum is σ = 102001416229608. Its totient is φ = 102001243774440.
The previous prime is 102001330002001. The next prime is 102001330002029. The reversal of 102001330002023 is 320200033100201.
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 102001330002023 - 212 = 102001329997927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102001330001992 and 102001330002010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102001330002029) 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, 41314361 + ... + 43713602.
It is an arithmetic number, because the mean of its divisors is an integer number (25500354057402).
Almost surely, 2102001330002023 is an apocalyptic number.
102001330002023 is a deficient number, since it is larger than the sum of its proper divisors (86227585).
102001330002023 is an equidigital number, since it uses as much as digits as its factorization.
102001330002023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86227584.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 102001330002023 its reverse (320200033100201), we get a palindrome (422201363102224).
The spelling of 102001330002023 in words is "one hundred two trillion, one billion, three hundred thirty million, two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •