Base | Representation |
---|---|
bin | 1011101011010010110… |
… | …00111001011011111001 |
3 | 1102100120022202101222210 |
4 | 11311221120321123321 |
5 | 23033124210433141 |
6 | 504150410205333 |
7 | 40662053344125 |
oct | 5655130713371 |
9 | 1370508671883 |
10 | 401200092921 |
11 | 145169aa1a31 |
12 | 65909123849 |
13 | 2baaa165bb4 |
14 | 155bd718585 |
15 | a681e51916 |
hex | 5d696396f9 |
401200092921 has 4 divisors (see below), whose sum is σ = 534933457232. Its totient is φ = 267466728612.
The previous prime is 401200092901. The next prime is 401200092947. The reversal of 401200092921 is 129290002104.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 401200092921 - 26 = 401200092857 is a prime.
It is a super-3 number, since 3×4012000929213 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (401200092901) 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 3 ways as a sum of consecutive naturals, for example, 66866682151 + ... + 66866682156.
It is an arithmetic number, because the mean of its divisors is an integer number (133733364308).
Almost surely, 2401200092921 is an apocalyptic number.
It is an amenable number.
401200092921 is a deficient number, since it is larger than the sum of its proper divisors (133733364311).
401200092921 is a wasteful number, since it uses less digits than its factorization.
401200092921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133733364310.
The product of its (nonzero) digits is 2592, while the sum is 30.
The spelling of 401200092921 in words is "four hundred one billion, two hundred million, ninety-two thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •