Base | Representation |
---|---|
bin | 1011101001000110001… |
… | …00101110110010101010 |
3 | 1102020112002221212100100 |
4 | 11310203010232302222 |
5 | 23023220210320242 |
6 | 503433345250230 |
7 | 40620610211043 |
oct | 5644304566252 |
9 | 1366462855310 |
10 | 400020401322 |
11 | 1447140a71a3 |
12 | 6563a033976 |
13 | 2b94c932329 |
14 | 1550ab938ca |
15 | a6135c854c |
hex | 5d2312ecaa |
400020401322 has 24 divisors (see below), whose sum is σ = 867549932964. Its totient is φ = 133211047104.
The previous prime is 400020401279. The next prime is 400020401323. The reversal of 400020401322 is 223104020004.
It can be written as a sum of positive squares in 2 ways, for example, as 273069998721 + 126950402601 = 522561^2 + 356301^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 400020401295 and 400020401304.
It is not an unprimeable number, because it can be changed into a prime (400020401323) 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 11 ways as a sum of consecutive naturals, for example, 10738113 + ... + 10775300.
Almost surely, 2400020401322 is an apocalyptic number.
400020401322 is an abundant number, since it is smaller than the sum of its proper divisors (467529531642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400020401322 is a wasteful number, since it uses less digits than its factorization.
400020401322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21514454 (or 21514451 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
Adding to 400020401322 its reverse (223104020004), we get a palindrome (623124421326).
The spelling of 400020401322 in words is "four hundred billion, twenty million, four hundred one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •