Base | Representation |
---|---|
bin | 1011101011010011111… |
… | …10101111000111001000 |
3 | 1102100121000102100112221 |
4 | 11311221332233013020 |
5 | 23033134230341404 |
6 | 504151402543424 |
7 | 40662233556046 |
oct | 5655176570710 |
9 | 1370530370487 |
10 | 401210012104 |
11 | 145174657400 |
12 | 65910507b74 |
13 | 2baac229a35 |
14 | 155c0b7b396 |
15 | a682c60954 |
hex | 5d69faf1c8 |
401210012104 has 24 divisors (see below), whose sum is σ = 826873942230. Its totient is φ = 182368186880.
The previous prime is 401210012101. The next prime is 401210012141.
It is a happy number.
401210012104 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in only one way, i.e., 313118584900 + 88091427204 = 559570^2 + 296802^2 .
It is not an unprimeable number, because it can be changed into a prime (401210012101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 207235609 + ... + 207237544.
Almost surely, 2401210012104 is an apocalyptic number.
401210012104 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
401210012104 is an abundant number, since it is smaller than the sum of its proper divisors (425663930126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401210012104 is a wasteful number, since it uses less digits than its factorization.
401210012104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414473181 (or 414473166 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
It can be divided in two parts, 4012100 and 12104, that added together give a palindrome (4024204).
The spelling of 401210012104 in words is "four hundred one billion, two hundred ten million, twelve thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •