Base | Representation |
---|---|
bin | 10100110011000000111010… |
… | …01000110110010101000100 |
3 | 12222221001122100112122120010 |
4 | 22121200131020312111010 |
5 | 21443243244430024011 |
6 | 241133331022110220 |
7 | 12430056552223611 |
oct | 1231403510662504 |
9 | 188831570478503 |
10 | 45733300626756 |
11 | 13632424a36a66 |
12 | 5167505a1b370 |
13 | 1c69829c32422 |
14 | b41709ab1508 |
15 | 544964c981a6 |
hex | 29981d236544 |
45733300626756 has 48 divisors (see below), whose sum is σ = 106763081564160. Its totient is φ = 15237000028320.
The previous prime is 45733300626719. The next prime is 45733300626779. The reversal of 45733300626756 is 65762600333754.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 45733300626696 and 45733300626705.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 219228541 + ... + 219437051.
It is an arithmetic number, because the mean of its divisors is an integer number (2224230865920).
Almost surely, 245733300626756 is an apocalyptic number.
It is an amenable number.
45733300626756 is an abundant number, since it is smaller than the sum of its proper divisors (61029780937404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45733300626756 is a wasteful number, since it uses less digits than its factorization.
45733300626756 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217344 (or 217342 counting only the distinct ones).
The product of its (nonzero) digits is 57153600, while the sum is 57.
The spelling of 45733300626756 in words is "forty-five trillion, seven hundred thirty-three billion, three hundred million, six hundred twenty-six thousand, seven hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •