Base | Representation |
---|---|
bin | 101111001010101111… |
… | …0100011111110110100 |
3 | 100200110012220000210120 |
4 | 1132111132203332310 |
5 | 3124421232032232 |
6 | 114311040251540 |
7 | 10214053225650 |
oct | 1362536437664 |
9 | 320405800716 |
10 | 101292064692 |
11 | 39a59803465 |
12 | 1776a610bb0 |
13 | 97233c9870 |
14 | 4c8c8b7a60 |
15 | 297c8ad92c |
hex | 17957a3fb4 |
101292064692 has 48 divisors (see below), whose sum is σ = 290890035072. Its totient is φ = 26714390400.
The previous prime is 101292064691. The next prime is 101292064697. The reversal of 101292064692 is 296460292101.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101292064691) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 46378059 + ... + 46380242.
It is an arithmetic number, because the mean of its divisors is an integer number (6060209064).
Almost surely, 2101292064692 is an apocalyptic number.
101292064692 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101292064692 is an abundant number, since it is smaller than the sum of its proper divisors (189597970380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101292064692 is a wasteful number, since it uses less digits than its factorization.
101292064692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92758328 (or 92758326 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 42.
The spelling of 101292064692 in words is "one hundred one billion, two hundred ninety-two million, sixty-four thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •