Base | Representation |
---|---|
bin | 1011101010111100010… |
… | …00101111111010011001 |
3 | 1102100002011112020211101 |
4 | 11311132020233322121 |
5 | 23032232343411413 |
6 | 504115544031401 |
7 | 40654301616232 |
oct | 5653610577231 |
9 | 1370064466741 |
10 | 401011310233 |
11 | 145082480786 |
12 | 65875a62561 |
13 | 2ba7a008571 |
14 | 155a2616089 |
15 | a6705b0edd |
hex | 5d5e22fe99 |
401011310233 has 8 divisors (see below), whose sum is σ = 406716301440. Its totient is φ = 395307900960.
The previous prime is 401011310209. The next prime is 401011310269. The reversal of 401011310233 is 332013110104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 401011310233 - 221 = 401009213081 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 401011310233.
It is not an unprimeable number, because it can be changed into a prime (401011310033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119853 + ... + 903541.
It is an arithmetic number, because the mean of its divisors is an integer number (50839537680).
Almost surely, 2401011310233 is an apocalyptic number.
It is an amenable number.
401011310233 is a deficient number, since it is larger than the sum of its proper divisors (5704991207).
401011310233 is an equidigital number, since it uses as much as digits as its factorization.
401011310233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790967.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 401011310233 its reverse (332013110104), we get a palindrome (733024420337).
The spelling of 401011310233 in words is "four hundred one billion, eleven million, three hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •