Base | Representation |
---|---|
bin | 1110010010100110011110… |
… | …00001100111000111111011 |
3 | 11010021020120220221221120010 |
4 | 13021103033001213013323 |
5 | 13104333312213344033 |
6 | 150500353154233003 |
7 | 6422262022011102 |
oct | 711231701470773 |
9 | 133236526857503 |
10 | 31425454043643 |
11 | a016507603050 |
12 | 3636568b85763 |
13 | 146c53b6639ba |
14 | 7a9000371039 |
15 | 3976ac8e7863 |
hex | 1c94cf0671fb |
31425454043643 has 64 divisors (see below), whose sum is σ = 46534102502400. Its totient is φ = 18705643200000.
The previous prime is 31425454043623. The next prime is 31425454043699. The reversal of 31425454043643 is 34634045452413.
It is not a de Polignac number, because 31425454043643 - 29 = 31425454043131 is a prime.
It is a super-2 number, since 2×314254540436432 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31425454043592 and 31425454043601.
It is not an unprimeable number, because it can be changed into a prime (31425454043603) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 356783613 + ... + 356871681.
It is an arithmetic number, because the mean of its divisors is an integer number (727095351600).
Almost surely, 231425454043643 is an apocalyptic number.
31425454043643 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
31425454043643 is a deficient number, since it is larger than the sum of its proper divisors (15108648458757).
31425454043643 is a wasteful number, since it uses less digits than its factorization.
31425454043643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89044.
The product of its (nonzero) digits is 8294400, while the sum is 48.
The spelling of 31425454043643 in words is "thirty-one trillion, four hundred twenty-five billion, four hundred fifty-four million, forty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •