Base | Representation |
---|---|
bin | 101101100101101111010011… |
… | …0110111010000101111111110 |
3 | 1221120212021111211212211012022 |
4 | 1123023132212313100233332 |
5 | 410030131022310430024 |
6 | 3540513525410040142 |
7 | 150316042453613600 |
oct | 13313364667205776 |
9 | 1846767454784168 |
10 | 401011011030014 |
11 | 1068578a64333a0 |
12 | 38b86754279052 |
13 | 1429b239b03568 |
14 | 71050721d3170 |
15 | 315633b3b235e |
hex | 16cb7a6dd0bfe |
401011011030014 has 48 divisors (see below), whose sum is σ = 766610617599216. Its totient is φ = 155567506550400.
The previous prime is 401011011029929. The next prime is 401011011030017. The reversal of 401011011030014 is 410030110110104.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 401011011029974 and 401011011030001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401011011030017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 798022157 + ... + 798524504.
It is an arithmetic number, because the mean of its divisors is an integer number (15971054533317).
Almost surely, 2401011011030014 is an apocalyptic number.
401011011030014 is a deficient number, since it is larger than the sum of its proper divisors (365599606569202).
401011011030014 is a wasteful number, since it uses less digits than its factorization.
401011011030014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1596546921 (or 1596546914 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 401011011030014 its reverse (410030110110104), we get a palindrome (811041121140118).
The spelling of 401011011030014 in words is "four hundred one trillion, eleven billion, eleven million, thirty thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •