Base | Representation |
---|---|
bin | 101111000010000100… |
… | …1110100011010101000 |
3 | 100122200221222110102200 |
4 | 1132010021310122220 |
5 | 3123322330224222 |
6 | 114222134500200 |
7 | 10203623566521 |
oct | 1360411643250 |
9 | 318627873380 |
10 | 101001414312 |
11 | 3991a735537 |
12 | 176a9204660 |
13 | 96a81235a6 |
14 | 4c62059848 |
15 | 29620e9eac |
hex | 17842746a8 |
101001414312 has 24 divisors (see below), whose sum is σ = 273545497290. Its totient is φ = 33667138080.
The previous prime is 101001414299. The next prime is 101001414313. The reversal of 101001414312 is 213414100101.
It can be written as a sum of positive squares in only one way, i.e., 55655415396 + 45345998916 = 235914^2 + 212946^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (101001414313) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 701398639 + ... + 701398782.
Almost surely, 2101001414312 is an apocalyptic number.
101001414312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101001414312 is an abundant number, since it is smaller than the sum of its proper divisors (172544082978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001414312 is a wasteful number, since it uses less digits than its factorization.
101001414312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1402797433 (or 1402797426 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 101001414312 its reverse (213414100101), we get a palindrome (314415514413).
The spelling of 101001414312 in words is "one hundred one billion, one million, four hundred fourteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •