Base | Representation |
---|---|
bin | 1011101011100111110… |
… | …01001011000000001001 |
3 | 1102101000121100221211120 |
4 | 11311303321023000021 |
5 | 23034004314410031 |
6 | 504220103345453 |
7 | 40666323322134 |
oct | 5656371130011 |
9 | 1371017327746 |
10 | 401376325641 |
11 | 14524a521205 |
12 | 65958152289 |
13 | 2bb0781b105 |
14 | 155d8cb121b |
15 | a692663a96 |
hex | 5d73e4b009 |
401376325641 has 16 divisors (see below), whose sum is σ = 535927570560. Its totient is φ = 267204871040.
The previous prime is 401376325619. The next prime is 401376325673. The reversal of 401376325641 is 146523673104.
It is a cyclic number.
It is not a de Polignac number, because 401376325641 - 26 = 401376325577 is a prime.
It is a super-2 number, since 2×4013763256412 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 401376325593 and 401376325602.
It is not an unprimeable number, because it can be changed into a prime (401376325601) 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 15 ways as a sum of consecutive naturals, for example, 7703365 + ... + 7755293.
It is an arithmetic number, because the mean of its divisors is an integer number (33495473160).
Almost surely, 2401376325641 is an apocalyptic number.
It is an amenable number.
401376325641 is a deficient number, since it is larger than the sum of its proper divisors (134551244919).
401376325641 is a wasteful number, since it uses less digits than its factorization.
401376325641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55536.
The product of its (nonzero) digits is 362880, while the sum is 42.
Adding to 401376325641 its reverse (146523673104), we get a palindrome (547899998745).
The spelling of 401376325641 in words is "four hundred one billion, three hundred seventy-six million, three hundred twenty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •