Base | Representation |
---|---|
bin | 10011000111111111100… |
… | …110100100001011011000 |
3 | 11122122022120111101101200 |
4 | 103013333212210023120 |
5 | 133013042322400031 |
6 | 2443432025514200 |
7 | 163644264640662 |
oct | 23077746441330 |
9 | 4578276441350 |
10 | 1314253325016 |
11 | 46740a815245 |
12 | 192864942960 |
13 | 96c1a041278 |
14 | 47878565532 |
15 | 242c03e78e6 |
hex | 131ff9a42d8 |
1314253325016 has 48 divisors (see below), whose sum is σ = 3566512600560. Its totient is φ = 437213486400.
The previous prime is 1314253324987. The next prime is 1314253325071. The reversal of 1314253325016 is 6105233524131.
1314253325016 is a `hidden beast` number, since 1 + 3 + 142 + 5 + 3 + 3 + 2 + 501 + 6 = 666.
It is a super-2 number, since 2×13142533250162 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18108435 + ... + 18180866.
It is an arithmetic number, because the mean of its divisors is an integer number (74302345845).
Almost surely, 21314253325016 is an apocalyptic number.
It is an amenable number.
1314253325016 is an abundant number, since it is smaller than the sum of its proper divisors (2252259275544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1314253325016 is a wasteful number, since it uses less digits than its factorization.
1314253325016 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36289816 (or 36289809 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
Adding to 1314253325016 its reverse (6105233524131), we get a palindrome (7419486849147).
The spelling of 1314253325016 in words is "one trillion, three hundred fourteen billion, two hundred fifty-three million, three hundred twenty-five thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •