Base | Representation |
---|---|
bin | 10011010010111010010111… |
… | …01101000010010101000001 |
3 | 12120020101110220112001112020 |
4 | 21221131023231002111001 |
5 | 21030143201003430101 |
6 | 230124351552352053 |
7 | 11636361660144315 |
oct | 1151351355022501 |
9 | 176211426461466 |
10 | 42431252014401 |
11 | 12579aa1644228 |
12 | 4913564545629 |
13 | 1a8a333038983 |
14 | a6997d965b45 |
15 | 4d8b030ce136 |
hex | 26974bb42541 |
42431252014401 has 16 divisors (see below), whose sum is σ = 57005930311680. Its totient is φ = 28072208339280.
The previous prime is 42431252014391. The next prime is 42431252014457. The reversal of 42431252014401 is 10441025213424.
It is not a de Polignac number, because 42431252014401 - 210 = 42431252013377 is a prime.
It is a super-2 number, since 2×424312520144012 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (42431252014471) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20356185 + ... + 22343606.
It is an arithmetic number, because the mean of its divisors is an integer number (3562870644480).
Almost surely, 242431252014401 is an apocalyptic number.
It is an amenable number.
42431252014401 is a deficient number, since it is larger than the sum of its proper divisors (14574678297279).
42431252014401 is a wasteful number, since it uses less digits than its factorization.
42431252014401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42702316.
The product of its (nonzero) digits is 30720, while the sum is 33.
Adding to 42431252014401 its reverse (10441025213424), we get a palindrome (52872277227825).
It can be divided in two parts, 4243125 and 2014401, that added together give a palindrome (6257526).
The spelling of 42431252014401 in words is "forty-two trillion, four hundred thirty-one billion, two hundred fifty-two million, fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •