Base | Representation |
---|---|
bin | 110101010100101101… |
… | …0010101000110000111 |
3 | 101221120111101220121000 |
4 | 1222221122111012013 |
5 | 3334004404320401 |
6 | 124334504424343 |
7 | 11162461565034 |
oct | 1525132250607 |
9 | 357514356530 |
10 | 114511401351 |
11 | 44622778786 |
12 | 1a2397780b3 |
13 | aa4c066069 |
14 | 578441a38b |
15 | 2ea31d9186 |
hex | 1aa9695187 |
114511401351 has 32 divisors (see below), whose sum is σ = 173251569600. Its totient is φ = 74735654400.
The previous prime is 114511401247. The next prime is 114511401371. The reversal of 114511401351 is 153104115411.
It is a happy number.
114511401351 is a `hidden beast` number, since 1 + 14 + 511 + 4 + 0 + 135 + 1 = 666.
It is not a de Polignac number, because 114511401351 - 213 = 114511393159 is a prime.
It is a super-2 number, since 2×1145114013512 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114511401371) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6795 + ... + 478611.
It is an arithmetic number, because the mean of its divisors is an integer number (5414111550).
Almost surely, 2114511401351 is an apocalyptic number.
114511401351 is a deficient number, since it is larger than the sum of its proper divisors (58740168249).
114511401351 is a wasteful number, since it uses less digits than its factorization.
114511401351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472016 (or 472010 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 27.
Adding to 114511401351 its reverse (153104115411), we get a palindrome (267615516762).
The spelling of 114511401351 in words is "one hundred fourteen billion, five hundred eleven million, four hundred one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •