Base | Representation |
---|---|
bin | 1101010000111100010000… |
… | …11000110111001011111100 |
3 | 10211021120100102012012212200 |
4 | 12220132020120313023330 |
5 | 12310402423222013022 |
6 | 142012124213031500 |
7 | 6100264125425433 |
oct | 650361030671374 |
9 | 124246312165780 |
10 | 29169411126012 |
11 | 9326750154613 |
12 | 3331288925590 |
13 | 13378820c9151 |
14 | 72bb426cc11a |
15 | 358b6b33bbac |
hex | 1a87886372fc |
29169411126012 has 144 divisors (see below), whose sum is σ = 74813772633600. Its totient is φ = 9581223075840.
The previous prime is 29169411126001. The next prime is 29169411126029. The reversal of 29169411126012 is 21062111496192.
29169411126012 is a `hidden beast` number, since 2 + 9 + 16 + 9 + 4 + 11 + 12 + 601 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4223163063 + ... + 4223169969.
Almost surely, 229169411126012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 29169411126012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37406886316800).
29169411126012 is an abundant number, since it is smaller than the sum of its proper divisors (45644361507588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29169411126012 is a wasteful number, since it uses less digits than its factorization.
29169411126012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9696 (or 9691 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 45.
The spelling of 29169411126012 in words is "twenty-nine trillion, one hundred sixty-nine billion, four hundred eleven million, one hundred twenty-six thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.765 sec. • engine limits •