Base | Representation |
---|---|
bin | 10101011011011011010… |
… | …000010100010010010011 |
3 | 12012202221001100200110211 |
4 | 111123123100110102103 |
5 | 143111244132143211 |
6 | 3044252233304551 |
7 | 211250225360251 |
oct | 25333320242223 |
9 | 5182831320424 |
10 | 1472557302931 |
11 | 518565231960 |
12 | 1b9484565157 |
13 | a8b27ac5110 |
14 | 513b4b0b5d1 |
15 | 28488019e21 |
hex | 156db414493 |
1472557302931 has 32 divisors (see below), whose sum is σ = 1759565304000. Its totient is φ = 1214763540480.
The previous prime is 1472557302893. The next prime is 1472557302959. The reversal of 1472557302931 is 1392037552741.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1472557302931 is a prime.
It is a super-2 number, since 2×14725573029312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1472557302431) 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 31 ways as a sum of consecutive naturals, for example, 1710535 + ... + 2423023.
It is an arithmetic number, because the mean of its divisors is an integer number (54986415750).
Almost surely, 21472557302931 is an apocalyptic number.
1472557302931 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1472557302931 is a deficient number, since it is larger than the sum of its proper divisors (287008001069).
1472557302931 is a wasteful number, since it uses less digits than its factorization.
1472557302931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712759.
The product of its (nonzero) digits is 1587600, while the sum is 49.
The spelling of 1472557302931 in words is "one trillion, four hundred seventy-two billion, five hundred fifty-seven million, three hundred two thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •