Base | Representation |
---|---|
bin | 1001100100101010111101… |
… | …10110100001101010111100 |
3 | 2202112110220010202220012020 |
4 | 10302111132312201222330 |
5 | 10224400402333212232 |
6 | 112434444425040140 |
7 | 4301621002130610 |
oct | 462253666415274 |
9 | 82473803686166 |
10 | 21051226069692 |
11 | 6786858348315 |
12 | 243ba51026050 |
13 | b99178340800 |
14 | 52ac55b8d340 |
15 | 2678cd92be2c |
hex | 13255eda1abc |
21051226069692 has 144 divisors (see below), whose sum is σ = 60949955404800. Its totient is φ = 5537085675264.
The previous prime is 21051226069651. The next prime is 21051226069693. The reversal of 21051226069692 is 29696062215012.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21051226069693) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3307309 + ... + 7282907.
It is an arithmetic number, because the mean of its divisors is an integer number (423263579200).
Almost surely, 221051226069692 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 21051226069692, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30474977702400).
21051226069692 is an abundant number, since it is smaller than the sum of its proper divisors (39898729335108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21051226069692 is a wasteful number, since it uses less digits than its factorization.
21051226069692 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3976012 (or 3975997 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 51.
The spelling of 21051226069692 in words is "twenty-one trillion, fifty-one billion, two hundred twenty-six million, sixty-nine thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.051 sec. • engine limits •