Base | Representation |
---|---|
bin | 10100100000011000110… |
… | …111000110011111010010 |
3 | 11222201022020010200021120 |
4 | 110200120313012133102 |
5 | 141041433042331040 |
6 | 2555210113503110 |
7 | 203544312343044 |
oct | 24403067063722 |
9 | 4881266120246 |
10 | 1409166370770 |
11 | 4a3695752324 |
12 | 1a9132b71a96 |
13 | a2b649985c2 |
14 | 4c2bdb6ba94 |
15 | 269c7c517d0 |
hex | 14818dc67d2 |
1409166370770 has 16 divisors (see below), whose sum is σ = 3381999289920. Its totient is φ = 375777698864.
The previous prime is 1409166370739. The next prime is 1409166370811. The reversal of 1409166370770 is 770736619041.
It is a super-2 number, since 2×14091663707702 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23486106150 + ... + 23486106209.
It is an arithmetic number, because the mean of its divisors is an integer number (211374955620).
Almost surely, 21409166370770 is an apocalyptic number.
1409166370770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1409166370770 is an abundant number, since it is smaller than the sum of its proper divisors (1972832919150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1409166370770 is a wasteful number, since it uses less digits than its factorization.
1409166370770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46972212369.
The product of its (nonzero) digits is 1333584, while the sum is 51.
The spelling of 1409166370770 in words is "one trillion, four hundred nine billion, one hundred sixty-six million, three hundred seventy thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •