Base | Representation |
---|---|
bin | 1011101011100011100… |
… | …00010001111000110011 |
3 | 1102100221002211210011000 |
4 | 11311301300101320303 |
5 | 23033421123040430 |
6 | 504212342253043 |
7 | 40665406311456 |
oct | 5656160217063 |
9 | 1370832753130 |
10 | 401340440115 |
11 | 14523124094a |
12 | 65948127183 |
13 | 2bb00265284 |
14 | 155d420d49d |
15 | a68e425e60 |
hex | 5d71c11e33 |
401340440115 has 32 divisors (see below), whose sum is σ = 714133143360. Its totient is φ = 213856526592.
The previous prime is 401340440113. The next prime is 401340440161. The reversal of 401340440115 is 511044043104.
It is not a de Polignac number, because 401340440115 - 21 = 401340440113 is a prime.
It is a super-2 number, since 2×4013404401152 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (401340440113) 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, 1179954 + ... + 1481543.
It is an arithmetic number, because the mean of its divisors is an integer number (22316660730).
Almost surely, 2401340440115 is an apocalyptic number.
401340440115 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
401340440115 is a deficient number, since it is larger than the sum of its proper divisors (312792703245).
401340440115 is a wasteful number, since it uses less digits than its factorization.
401340440115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2662628 (or 2662622 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 401340440115 its reverse (511044043104), we get a palindrome (912384483219).
The spelling of 401340440115 in words is "four hundred one billion, three hundred forty million, four hundred forty thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •