Base | Representation |
---|---|
bin | 101010010110010000… |
… | …101001011101001111 |
3 | 11100100220222210121110 |
4 | 222112100221131033 |
5 | 1221110434310341 |
6 | 32520001103103 |
7 | 3166542613464 |
oct | 522620513517 |
9 | 140326883543 |
10 | 45470619471 |
11 | 18313a85462 |
12 | 8990027a93 |
13 | 439857a1c4 |
14 | 22b4d7766b |
15 | 12b1e01216 |
hex | a9642974f |
45470619471 has 8 divisors (see below), whose sum is σ = 60684211120. Its totient is φ = 30285387072.
The previous prime is 45470619433. The next prime is 45470619479. The reversal of 45470619471 is 17491607454.
45470619471 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 45470619471 - 218 = 45470357327 is a prime.
It is a super-3 number, since 3×454706194713 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 45470619471.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45470619479) 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, 7086070 + ... + 7092483.
It is an arithmetic number, because the mean of its divisors is an integer number (7585526390).
Almost surely, 245470619471 is an apocalyptic number.
45470619471 is a deficient number, since it is larger than the sum of its proper divisors (15213591649).
45470619471 is a wasteful number, since it uses less digits than its factorization.
45470619471 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14179625.
The product of its (nonzero) digits is 846720, while the sum is 48.
The spelling of 45470619471 in words is "forty-five billion, four hundred seventy million, six hundred nineteen thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •