Base | Representation |
---|---|
bin | 110001010111111110… |
… | …1111100001000101001 |
3 | 101010200111220111210100 |
4 | 1202233331330020221 |
5 | 3214123023340001 |
6 | 120413222140013 |
7 | 10442362403400 |
oct | 1425775741051 |
9 | 333614814710 |
10 | 106031465001 |
11 | 40a70aa8020 |
12 | 18671881609 |
13 | 9cca274247 |
14 | 51bc100637 |
15 | 2b589da586 |
hex | 18aff7c229 |
106031465001 has 36 divisors (see below), whose sum is σ = 194358241584. Its totient is φ = 55081278000.
The previous prime is 106031464967. The next prime is 106031465041. The reversal of 106031465001 is 100564130601.
106031465001 is a `hidden beast` number, since 1 + 0 + 6 + 0 + 3 + 1 + 4 + 650 + 0 + 1 = 666.
It is not a de Polignac number, because 106031465001 - 29 = 106031464489 is a prime.
It is a super-2 number, since 2×1060314650012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106031465041) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 10923975 + ... + 10933676.
It is an arithmetic number, because the mean of its divisors is an integer number (5398840044).
Almost surely, 2106031465001 is an apocalyptic number.
106031465001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106031465001 is a deficient number, since it is larger than the sum of its proper divisors (88326776583).
106031465001 is a wasteful number, since it uses less digits than its factorization.
106031465001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21857682 (or 21857672 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 106031465001 its reverse (100564130601), we get a palindrome (206595595602).
The spelling of 106031465001 in words is "one hundred six billion, thirty-one million, four hundred sixty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •