Base | Representation |
---|---|
bin | 1011101100110010010… |
… | …01101110000000101011 |
3 | 1102102122011121001112202 |
4 | 11312121021232000223 |
5 | 23041244330422311 |
6 | 504402113330415 |
7 | 41020653456500 |
oct | 5663111560053 |
9 | 1372564531482 |
10 | 402001420331 |
11 | 14554035a095 |
12 | 65ab1566a0b |
13 | 2bba7192024 |
14 | 15657d0b4a7 |
15 | a6cc48be3b |
hex | 5d9926e02b |
402001420331 has 24 divisors (see below), whose sum is σ = 479650597776. Its totient is φ = 335739962880.
The previous prime is 402001420319. The next prime is 402001420351. The reversal of 402001420331 is 133024100204.
It is not a de Polignac number, because 402001420331 - 222 = 401997226027 is a prime.
It is a super-2 number, since 2×4020014203312 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (402001420351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1453955 + ... + 1708211.
It is an arithmetic number, because the mean of its divisors is an integer number (19985441574).
Almost surely, 2402001420331 is an apocalyptic number.
402001420331 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
402001420331 is a deficient number, since it is larger than the sum of its proper divisors (77649177445).
402001420331 is a wasteful number, since it uses less digits than its factorization.
402001420331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255099 (or 255092 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 402001420331 its reverse (133024100204), we get a palindrome (535025520535).
The spelling of 402001420331 in words is "four hundred two billion, one million, four hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •