Base | Representation |
---|---|
bin | 11001000000101101100001… |
… | …011100111101101001000010 |
3 | 112102110220100002022221102101 |
4 | 121000231201130331221002 |
5 | 103404220041323302242 |
6 | 1025541153304341014 |
7 | 32112145411102624 |
oct | 3100554134755102 |
9 | 472426302287371 |
10 | 110000042400322 |
11 | 3205a835270188 |
12 | 104068b377476a |
13 | 494bc61cc86c9 |
14 | 1d2405d81ac14 |
15 | cab5482da9b7 |
hex | 640b6173da42 |
110000042400322 has 4 divisors (see below), whose sum is σ = 165000063600486. Its totient is φ = 55000021200160.
The previous prime is 110000042400317. The next prime is 110000042400329. The reversal of 110000042400322 is 223004240000011.
110000042400322 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 95007108571281 + 14992933829041 = 9747159^2 + 3872071^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 110000042400322.
It is not an unprimeable number, because it can be changed into a prime (110000042400329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27500010600079 + ... + 27500010600082.
Almost surely, 2110000042400322 is an apocalyptic number.
110000042400322 is a deficient number, since it is larger than the sum of its proper divisors (55000021200164).
110000042400322 is an equidigital number, since it uses as much as digits as its factorization.
110000042400322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55000021200163.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 110000042400322 its reverse (223004240000011), we get a palindrome (333004282400333).
The spelling of 110000042400322 in words is "one hundred ten trillion, forty-two million, four hundred thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •