Base | Representation |
---|---|
bin | 1011101011111001010… |
… | …10000001111000001011 |
3 | 1102101101212000121210010 |
4 | 11311330222001320023 |
5 | 23034304434213201 |
6 | 504242434523003 |
7 | 41003060112504 |
oct | 5657452017013 |
9 | 1371355017703 |
10 | 401523351051 |
11 | 145315511609 |
12 | 65999436463 |
13 | 2bb2c1180b4 |
14 | 15610623bab |
15 | a6a0506bd6 |
hex | 5d7ca81e0b |
401523351051 has 4 divisors (see below), whose sum is σ = 535364468072. Its totient is φ = 267682234032.
The previous prime is 401523351043. The next prime is 401523351077. The reversal of 401523351051 is 150153325104.
401523351051 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 401523351051 - 23 = 401523351043 is a prime.
It is a super-2 number, since 2×4015233510512 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401523351001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66920558506 + ... + 66920558511.
It is an arithmetic number, because the mean of its divisors is an integer number (133841117018).
Almost surely, 2401523351051 is an apocalyptic number.
401523351051 is a deficient number, since it is larger than the sum of its proper divisors (133841117021).
401523351051 is a wasteful number, since it uses less digits than its factorization.
401523351051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133841117020.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 401523351051 its reverse (150153325104), we get a palindrome (551676676155).
The spelling of 401523351051 in words is "four hundred one billion, five hundred twenty-three million, three hundred fifty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •