Base | Representation |
---|---|
bin | 1011101011000101010… |
… | …01111000000000101111 |
3 | 1102100021110010220222202 |
4 | 11311202221320000233 |
5 | 23032411244244043 |
6 | 504131252332115 |
7 | 40656212060405 |
oct | 5654251700057 |
9 | 1370243126882 |
10 | 401087103023 |
11 | 145111238a52 |
12 | 6589731403b |
13 | 2ba8c924979 |
14 | 155ac705475 |
15 | a6770831b8 |
hex | 5d62a7802f |
401087103023 has 8 divisors (see below), whose sum is σ = 406278626880. Its totient is φ = 395898441120.
The previous prime is 401087103019. The next prime is 401087103073. The reversal of 401087103023 is 320301780104.
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 401087103023 - 22 = 401087103019 is a prime.
It is a super-2 number, since 2×4010871030232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401087103073) 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 7 ways as a sum of consecutive naturals, for example, 432668 + ... + 994673.
It is an arithmetic number, because the mean of its divisors is an integer number (50784828360).
Almost surely, 2401087103023 is an apocalyptic number.
401087103023 is a deficient number, since it is larger than the sum of its proper divisors (5191523857).
401087103023 is a wasteful number, since it uses less digits than its factorization.
401087103023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1430977.
The product of its (nonzero) digits is 4032, while the sum is 29.
Adding to 401087103023 its reverse (320301780104), we get a palindrome (721388883127).
The spelling of 401087103023 in words is "four hundred one billion, eighty-seven million, one hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •