Base | Representation |
---|---|
bin | 101111010011000010… |
… | …0010010101001110010 |
3 | 100201011121121110020002 |
4 | 1132212010102221302 |
5 | 3131004010000032 |
6 | 114354421550002 |
7 | 10224003034610 |
oct | 1364604225162 |
9 | 321147543202 |
10 | 101570390642 |
11 | 3a091923906 |
12 | 17827875302 |
13 | 9768c79286 |
14 | 4cb78486b0 |
15 | 299703a862 |
hex | 17a6112a72 |
101570390642 has 16 divisors (see below), whose sum is σ = 174735943872. Its totient is φ = 43376348880.
The previous prime is 101570390587. The next prime is 101570390657. The reversal of 101570390642 is 246093075101.
It is a junction number, because it is equal to n+sod(n) for n = 101570390596 and 101570390605.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12814109 + ... + 12822032.
It is an arithmetic number, because the mean of its divisors is an integer number (10920996492).
Almost surely, 2101570390642 is an apocalyptic number.
101570390642 is a deficient number, since it is larger than the sum of its proper divisors (73165553230).
101570390642 is a wasteful number, since it uses less digits than its factorization.
101570390642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25636433.
The product of its (nonzero) digits is 45360, while the sum is 38.
The spelling of 101570390642 in words is "one hundred one billion, five hundred seventy million, three hundred ninety thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •