Base | Representation |
---|---|
bin | 100011011110000110110110… |
… | …1001111101001010110011000 |
3 | 1111220201000111001002110020102 |
4 | 1012330031231033221112120 |
5 | 311343311314334221100 |
6 | 3023323202421314532 |
7 | 122501224104265223 |
oct | 10674155517512630 |
9 | 1456630431073212 |
10 | 312001142101400 |
11 | 9045aa39954a84 |
12 | 2ababab3265a48 |
13 | 105127735c653b |
14 | 5708d15d925ba |
15 | 2610cebb7ecd5 |
hex | 11bc36d3e9598 |
312001142101400 has 48 divisors (see below), whose sum is σ = 736229560721640. Its totient is φ = 122937763449600.
The previous prime is 312001142101391. The next prime is 312001142101409. The reversal of 312001142101400 is 4101241100213.
It is an interprime number because it is at equal distance from previous prime (312001142101391) and next prime (312001142101409).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312001142101409) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11641820261 + ... + 11641847060.
Almost surely, 2312001142101400 is an apocalyptic number.
It is an amenable number.
312001142101400 is an abundant number, since it is smaller than the sum of its proper divisors (424228418620240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312001142101400 is a wasteful number, since it uses less digits than its factorization.
312001142101400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23283667404 (or 23283667395 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 312001142101400 its reverse (4101241100213), we get a palindrome (316102383201613).
The spelling of 312001142101400 in words is "three hundred twelve trillion, one billion, one hundred forty-two million, one hundred one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •