Base | Representation |
---|---|
bin | 101101100111011011110011… |
… | …0111011110111010011100011 |
3 | 1221121200112221020110212201020 |
4 | 1123032313212323313103203 |
5 | 410042440220114243243 |
6 | 3541212542212540523 |
7 | 150341631502155162 |
oct | 13316674673672343 |
9 | 1847615836425636 |
10 | 401244014212323 |
11 | 1069376a3681977 |
12 | 39003940621743 |
13 | 142b71c0744679 |
14 | 71124575133d9 |
15 | 315c426e32283 |
hex | 16cede6ef74e3 |
401244014212323 has 8 divisors (see below), whose sum is σ = 545086207986768. Its totient is φ = 262448914956384.
The previous prime is 401244014212277. The next prime is 401244014212367. The reversal of 401244014212323 is 323212410442104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 401244014212323 - 229 = 401243477341411 is a prime.
It is a super-2 number, since 2×4012440142123232 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (401244014212823) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1261773629440 + ... + 1261773629757.
It is an arithmetic number, because the mean of its divisors is an integer number (68135775998346).
Almost surely, 2401244014212323 is an apocalyptic number.
401244014212323 is a deficient number, since it is larger than the sum of its proper divisors (143842193774445).
401244014212323 is a wasteful number, since it uses less digits than its factorization.
401244014212323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2523547259253.
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 401244014212323 its reverse (323212410442104), we get a palindrome (724456424654427).
The spelling of 401244014212323 in words is "four hundred one trillion, two hundred forty-four billion, fourteen million, two hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •