Base | Representation |
---|---|
bin | 10111101001101111000000… |
… | …101010001010101011110110 |
3 | 111122022111122212122202111122 |
4 | 113221233000222022223312 |
5 | 102113303144034033420 |
6 | 1005123305515503542 |
7 | 30624263014250051 |
oct | 2751570052125366 |
9 | 448274585582448 |
10 | 104023045221110 |
11 | 30165a20174524 |
12 | b800443457bb2 |
13 | 460743c4a4992 |
14 | 1b98a56a51a98 |
15 | c05d28a1d725 |
hex | 5e9bc0a8aaf6 |
104023045221110 has 16 divisors (see below), whose sum is σ = 195382415372256. Its totient is φ = 39800121649728.
The previous prime is 104023045221089. The next prime is 104023045221113. The reversal of 104023045221110 is 11122540320401.
It is a happy number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 104023045221110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104023045221113) 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, 226137054599 + ... + 226137055058.
It is an arithmetic number, because the mean of its divisors is an integer number (12211400960766).
Almost surely, 2104023045221110 is an apocalyptic number.
104023045221110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104023045221110 is a deficient number, since it is larger than the sum of its proper divisors (91359370151146).
104023045221110 is a wasteful number, since it uses less digits than its factorization.
104023045221110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452274109687.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 104023045221110 its reverse (11122540320401), we get a palindrome (115145585541511).
The spelling of 104023045221110 in words is "one hundred four trillion, twenty-three billion, forty-five million, two hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •