Base | Representation |
---|---|
bin | 10111011011001000110111… |
… | …110001111100111001000001 |
3 | 111111202121200102101110122201 |
4 | 113123020313301330321001 |
5 | 102000340000434400301 |
6 | 1003034424450233201 |
7 | 30461644111415260 |
oct | 2733106761747101 |
9 | 444677612343581 |
10 | 103020021403201 |
11 | 2a9096003a0471 |
12 | b679b78885801 |
13 | 4563991905796 |
14 | 1b622a4ba25d7 |
15 | bd9bc1aab201 |
hex | 5db237c7ce41 |
103020021403201 has 8 divisors (see below), whose sum is σ = 119155687406784. Its totient is φ = 87238985421840.
The previous prime is 103020021403199. The next prime is 103020021403319. The reversal of 103020021403201 is 102304120020301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103020021403201 - 21 = 103020021403199 is a prime.
It is a super-2 number, since 2×1030200214032012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103020081403201) 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, 88657504930 + ... + 88657506091.
It is an arithmetic number, because the mean of its divisors is an integer number (14894460925848).
Almost surely, 2103020021403201 is an apocalyptic number.
It is an amenable number.
103020021403201 is a deficient number, since it is larger than the sum of its proper divisors (16135666003583).
103020021403201 is an equidigital number, since it uses as much as digits as its factorization.
103020021403201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 177315011111.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 103020021403201 its reverse (102304120020301), we get a palindrome (205324141423502).
The spelling of 103020021403201 in words is "one hundred three trillion, twenty billion, twenty-one million, four hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •