Base | Representation |
---|---|
bin | 1100000110001… |
… | …00111011101100 |
3 | 21001221012120122 |
4 | 12003010323230 |
5 | 201434014212 |
6 | 14022504112 |
7 | 2341323464 |
oct | 603047354 |
9 | 231835518 |
10 | 101469932 |
11 | 52305953 |
12 | 29b95038 |
13 | 180398a5 |
14 | d694ba4 |
15 | 8d95272 |
hex | 60c4eec |
101469932 has 12 divisors (see below), whose sum is σ = 179144616. Its totient is φ = 50285760.
The previous prime is 101469883. The next prime is 101469961. The reversal of 101469932 is 239964101.
It is a super-2 number, since 2×1014699322 = 20592294200169248, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101469892 and 101469901.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111794 + ... + 112697.
It is an arithmetic number, because the mean of its divisors is an integer number (14928718).
Almost surely, 2101469932 is an apocalyptic number.
It is an amenable number.
101469932 is a deficient number, since it is larger than the sum of its proper divisors (77674684).
101469932 is a wasteful number, since it uses less digits than its factorization.
101469932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224608 (or 224606 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 35.
The square root of 101469932 is about 10073.2284794896. The cubic root of 101469932 is about 466.4221033748.
The spelling of 101469932 in words is "one hundred one million, four hundred sixty-nine thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •