Base | Representation |
---|---|
bin | 101001111010011010… |
… | …100011000011010111 |
3 | 11022011100221021011220 |
4 | 221322122203003113 |
5 | 1214131340441011 |
6 | 32401352101423 |
7 | 3152141015154 |
oct | 517232430327 |
9 | 138140837156 |
10 | 45003452631 |
11 | 180a4304065 |
12 | 887b694873 |
13 | 432284c817 |
14 | 226cccb22b |
15 | 1285dc1506 |
hex | a7a6a30d7 |
45003452631 has 8 divisors (see below), whose sum is σ = 60006299760. Its totient is φ = 30001453632.
The previous prime is 45003452617. The next prime is 45003452633. The reversal of 45003452631 is 13625430054.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 45003452631 - 29 = 45003452119 is a prime.
It is a super-2 number, since 2×450034526312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 45003452592 and 45003452601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45003452633) 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 7 ways as a sum of consecutive naturals, for example, 75696 + ... + 309413.
It is an arithmetic number, because the mean of its divisors is an integer number (7500787470).
Almost surely, 245003452631 is an apocalyptic number.
45003452631 is a deficient number, since it is larger than the sum of its proper divisors (15002847129).
45003452631 is a wasteful number, since it uses less digits than its factorization.
45003452631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424065.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 45003452631 its reverse (13625430054), we get a palindrome (58628882685).
The spelling of 45003452631 in words is "forty-five billion, three million, four hundred fifty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •