Base | Representation |
---|---|
bin | 1000001110001111110… |
… | …1101110100100011000 |
3 | 111111121220022112101000 |
4 | 2003203331232210120 |
5 | 4303301433004112 |
6 | 144521240225000 |
7 | 13130433321354 |
oct | 2034375564430 |
9 | 444556275330 |
10 | 141263563032 |
11 | 54a00664809 |
12 | 23464a6b160 |
13 | 104235b0127 |
14 | 6ba1386464 |
15 | 3a1bb157dc |
hex | 20e3f6e918 |
141263563032 has 64 divisors (see below), whose sum is σ = 403004181600. Its totient is φ = 45815207040.
The previous prime is 141263563027. The next prime is 141263563057. The reversal of 141263563032 is 230365362141.
141263563032 is a `hidden beast` number, since 1 + 4 + 1 + 2 + 63 + 563 + 0 + 32 = 666.
141263563032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 8829819 + ... + 8845802.
Almost surely, 2141263563032 is an apocalyptic number.
141263563032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
141263563032 is an abundant number, since it is smaller than the sum of its proper divisors (261740618568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141263563032 is a wasteful number, since it uses less digits than its factorization.
141263563032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17675673 (or 17675663 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
The spelling of 141263563032 in words is "one hundred forty-one billion, two hundred sixty-three million, five hundred sixty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •