Base | Representation |
---|---|
bin | 11000010011101000001100… |
… | …101101101011001110100000 |
3 | 112000111201121122120201222111 |
4 | 120103220030231223032200 |
5 | 103002440143010010233 |
6 | 1015210024425245104 |
7 | 31342260650164315 |
oct | 3023501455531640 |
9 | 460451548521874 |
10 | 106901949297568 |
11 | 310759534a5547 |
12 | bba6392633794 |
13 | 4785a6ca66149 |
14 | 1c58120c44d0c |
15 | c55b71e7dacd |
hex | 613a0cb6b3a0 |
106901949297568 has 48 divisors (see below), whose sum is σ = 212344684888896. Its totient is φ = 52973224944640.
The previous prime is 106901949297511. The next prime is 106901949297569. The reversal of 106901949297568 is 865792949109601.
It is a happy number.
It is a super-2 number, since 2×1069019492975682 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106901949297494 and 106901949297503.
It is not an unprimeable number, because it can be changed into a prime (106901949297569) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39339933 + ... + 41969443.
It is an arithmetic number, because the mean of its divisors is an integer number (4423847601852).
Almost surely, 2106901949297568 is an apocalyptic number.
It is an amenable number.
106901949297568 is a deficient number, since it is larger than the sum of its proper divisors (105442735591328).
106901949297568 is a wasteful number, since it uses less digits than its factorization.
106901949297568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2640877 (or 2640869 counting only the distinct ones).
The product of its (nonzero) digits is 529079040, while the sum is 76.
The spelling of 106901949297568 in words is "one hundred six trillion, nine hundred one billion, nine hundred forty-nine million, two hundred ninety-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •