Base | Representation |
---|---|
bin | 110101101111101011100101… |
… | …1000000001011001010111111 |
3 | 2021222212002110210112012102211 |
4 | 1223133113023000023022333 |
5 | 443430433114221432111 |
6 | 4353240331022001251 |
7 | 201401532401666464 |
oct | 15337271300131277 |
9 | 2258762423465384 |
10 | 472746161124031 |
11 | 1276a458053a983 |
12 | 45031458a16227 |
13 | 173a2a05599312 |
14 | 84a50717c366b |
15 | 399c32c504521 |
hex | 1adf5cb00b2bf |
472746161124031 has 8 divisors (see below), whose sum is σ = 474818634210800. Its totient is φ = 470676319751808.
The previous prime is 472746161124023. The next prime is 472746161124053. The reversal of 472746161124031 is 130421161647274.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 472746161124031 - 23 = 472746161124023 is a prime.
It is a super-2 number, since 2×4727461611240312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (472746161124131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 657568581 + ... + 658287118.
It is an arithmetic number, because the mean of its divisors is an integer number (59352329276350).
Almost surely, 2472746161124031 is an apocalyptic number.
472746161124031 is a deficient number, since it is larger than the sum of its proper divisors (2072473086769).
472746161124031 is a wasteful number, since it uses less digits than its factorization.
472746161124031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1315857273.
The product of its (nonzero) digits is 1354752, while the sum is 49.
The spelling of 472746161124031 in words is "four hundred seventy-two trillion, seven hundred forty-six billion, one hundred sixty-one million, one hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •