Base | Representation |
---|---|
bin | 10111011011001001111111… |
… | …011001110001000110011001 |
3 | 111111202201210011110002010202 |
4 | 113123021333121301012121 |
5 | 102000344431043214001 |
6 | 1003035144013151545 |
7 | 30462015642131063 |
oct | 2733117731610631 |
9 | 444681704402122 |
10 | 103021223023001 |
11 | 2a90a067703188 |
12 | b67a25318b5b5 |
13 | 4563b2384630a |
14 | 1b6237a5d4733 |
15 | bd9c4231696b |
hex | 5db27f671199 |
103021223023001 has 8 divisors (see below), whose sum is σ = 106234650971904. Its totient is φ = 99850357033920.
The previous prime is 103021223022989. The next prime is 103021223023003. The reversal of 103021223023001 is 100320322120301.
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 103021223023001 - 230 = 103020149281177 is a prime.
It is a super-2 number, since 2×1030212230230012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103021223023003) 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, 10640485040 + ... + 10640494721.
It is an arithmetic number, because the mean of its divisors is an integer number (13279331371488).
Almost surely, 2103021223023001 is an apocalyptic number.
It is an amenable number.
103021223023001 is a deficient number, since it is larger than the sum of its proper divisors (3213427948903).
103021223023001 is a wasteful number, since it uses less digits than its factorization.
103021223023001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21280979911.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 103021223023001 its reverse (100320322120301), we get a palindrome (203341545143302).
The spelling of 103021223023001 in words is "one hundred three trillion, twenty-one billion, two hundred twenty-three million, twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.689 sec. • engine limits •