Base | Representation |
---|---|
bin | 11001000001001011011010… |
… | …001101011010111001001000 |
3 | 112102120222011112201102111212 |
4 | 121001023122031122321020 |
5 | 103410231302040440130 |
6 | 1030004021504312252 |
7 | 32114362555636556 |
oct | 3101133215327110 |
9 | 472528145642455 |
10 | 110032133140040 |
11 | 32072402697981 |
12 | 10410b6a912688 |
13 | 4951ca75886a7 |
14 | 1d258257c0bd6 |
15 | cac2c574ce95 |
hex | 6412da35ae48 |
110032133140040 has 32 divisors (see below), whose sum is σ = 247642374125880. Its totient is φ = 44000395556352.
The previous prime is 110032133140001. The next prime is 110032133140057. The reversal of 110032133140040 is 40041331230011.
It can be written as a sum of positive squares in 4 ways, for example, as 68021487180196 + 42010645959844 = 8247514^2 + 6481562^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110032133139988 and 110032133140015.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 389160029 + ... + 389442668.
Almost surely, 2110032133140040 is an apocalyptic number.
110032133140040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110032133140040 is an abundant number, since it is smaller than the sum of its proper divisors (137610240985840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110032133140040 is a wasteful number, since it uses less digits than its factorization.
110032133140040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778606241 (or 778606237 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 110032133140040 its reverse (40041331230011), we get a palindrome (150073464370051).
The spelling of 110032133140040 in words is "one hundred ten trillion, thirty-two billion, one hundred thirty-three million, one hundred forty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •