Base | Representation |
---|---|
bin | 1011111010101001100000… |
… | …1010000010001101011011 |
3 | 1201101120002001111220000002 |
4 | 2332222120022002031123 |
5 | 3204131302433120443 |
6 | 43511022522003215 |
7 | 2521413543055160 |
oct | 276523012021533 |
9 | 51346061456002 |
10 | 13102203020123 |
11 | 41a1682038488 |
12 | 157736534650b |
13 | 7406bca16059 |
14 | 3342158ac067 |
15 | 17ac41ed82b8 |
hex | bea9828235b |
13102203020123 has 8 divisors (see below), whose sum is σ = 14996599788000. Its totient is φ = 11213469622080.
The previous prime is 13102203020117. The next prime is 13102203020317. The reversal of 13102203020123 is 32102030220131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13102203020123 - 26 = 13102203020059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13102203020095 and 13102203020104.
It is not an unprimeable number, because it can be changed into a prime (13102203010123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1415837498 + ... + 1415846751.
It is an arithmetic number, because the mean of its divisors is an integer number (1874574973500).
Almost surely, 213102203020123 is an apocalyptic number.
13102203020123 is a deficient number, since it is larger than the sum of its proper divisors (1894396767877).
13102203020123 is an equidigital number, since it uses as much as digits as its factorization.
13102203020123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2831684917.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13102203020123 its reverse (32102030220131), we get a palindrome (45204233240254).
The spelling of 13102203020123 in words is "thirteen trillion, one hundred two billion, two hundred three million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •