Base | Representation |
---|---|
bin | 101101100110100011100110… |
… | …0100110000010101110011000 |
3 | 1221121021000101101020011010022 |
4 | 1123031013030212002232120 |
5 | 410034001021134400044 |
6 | 3541041301155210012 |
7 | 150330126431404142 |
oct | 13315071446025630 |
9 | 1847230341204108 |
10 | 401123313200024 |
11 | 1068a0495046948 |
12 | 38ba4475ba6908 |
13 | 142a89c625522c |
14 | 710a68704bc92 |
15 | 31592106593ee |
hex | 16cd1cc982b98 |
401123313200024 has 8 divisors (see below), whose sum is σ = 752106212250060. Its totient is φ = 200561656600008.
The previous prime is 401123313200021. The next prime is 401123313200033. The reversal of 401123313200024 is 420002313321104.
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 401123313199966 and 401123313200002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401123313200021) 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 as a sum of consecutive naturals, namely, 25070207074994 + ... + 25070207075009.
Almost surely, 2401123313200024 is an apocalyptic number.
It is an amenable number.
401123313200024 is a deficient number, since it is larger than the sum of its proper divisors (350982899050036).
401123313200024 is a wasteful number, since it uses less digits than its factorization.
401123313200024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50140414150009 (or 50140414150005 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 401123313200024 its reverse (420002313321104), we get a palindrome (821125626521128).
The spelling of 401123313200024 in words is "four hundred one trillion, one hundred twenty-three billion, three hundred thirteen million, two hundred thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •