Base | Representation |
---|---|
bin | 10100101111011110100… |
… | …001010111010011100110 |
3 | 12001021010022100102221210 |
4 | 110233132201113103212 |
5 | 141323123032310032 |
6 | 3010445455252250 |
7 | 204656635350360 |
oct | 24573641272346 |
9 | 5037108312853 |
10 | 1425367463142 |
11 | 4aa549856867 |
12 | 1b02b481a086 |
13 | a45472cc0ac |
14 | 4cdb96c7d30 |
15 | 2712521a2cc |
hex | 14bde8574e6 |
1425367463142 has 32 divisors (see below), whose sum is σ = 3258032016384. Its totient is φ = 407241691200.
The previous prime is 1425367463141. The next prime is 1425367463189. The reversal of 1425367463142 is 2413647635241.
It is a junction number, because it is equal to n+sod(n) for n = 1425367463091 and 1425367463100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425367463141) 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 15 ways as a sum of consecutive naturals, for example, 3059842 + ... + 3494762.
It is an arithmetic number, because the mean of its divisors is an integer number (101813500512).
Almost surely, 21425367463142 is an apocalyptic number.
1425367463142 is an abundant number, since it is smaller than the sum of its proper divisors (1832664553242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1425367463142 is a wasteful number, since it uses less digits than its factorization.
1425367463142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 512964.
The product of its digits is 2903040, while the sum is 48.
The spelling of 1425367463142 in words is "one trillion, four hundred twenty-five billion, three hundred sixty-seven million, four hundred sixty-three thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •