Base | Representation |
---|---|
bin | 1011101001010000110… |
… | …10111001111000100010 |
3 | 1102020202100202000210200 |
4 | 11310220122321320202 |
5 | 23023411141200002 |
6 | 503450312010030 |
7 | 40623046510164 |
oct | 5645032717042 |
9 | 1366670660720 |
10 | 400110100002 |
11 | 14475a7a2138 |
12 | 65664090916 |
13 | 2b9653aa082 |
14 | 15518a62934 |
15 | a61b3e5b1c |
hex | 5d286b9e22 |
400110100002 has 24 divisors (see below), whose sum is σ = 878780633484. Its totient is φ = 131543046144.
The previous prime is 400110100001. The next prime is 400110100079. The reversal of 400110100002 is 200001011004.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 388242394281 + 11867705721 = 623091^2 + 108939^2 .
It is a super-2 number, since 2×4001101000022 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (400110100001) 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, 152247583 + ... + 152250210.
Almost surely, 2400110100002 is an apocalyptic number.
400110100002 is an abundant number, since it is smaller than the sum of its proper divisors (478670533482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400110100002 is a wasteful number, since it uses less digits than its factorization.
400110100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304497874 (or 304497871 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 400110100002 its reverse (200001011004), we get a palindrome (600111111006).
The spelling of 400110100002 in words is "four hundred billion, one hundred ten million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •