Base | Representation |
---|---|
bin | 1000011110100010000… |
… | …0101001000111100001 |
3 | 111220220112112222002200 |
4 | 2013220200221013201 |
5 | 4341230001320110 |
6 | 150523111003413 |
7 | 13343652210021 |
oct | 2075040510741 |
9 | 456815488080 |
10 | 145634791905 |
11 | 56844052759 |
12 | 24284969569 |
13 | 1096c0ab5a5 |
14 | 7097b31a81 |
15 | 3bc57696c0 |
hex | 21e88291e1 |
145634791905 has 48 divisors (see below), whose sum is σ = 271664447184. Its totient is φ = 71904522240.
The previous prime is 145634791889. The next prime is 145634791919. The reversal of 145634791905 is 509197436541.
145634791905 is a `hidden beast` number, since 1 + 4 + 563 + 4 + 79 + 1 + 9 + 0 + 5 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 1757957184 + 143876834721 = 41928^2 + 379311^2 .
It is not a de Polignac number, because 145634791905 - 24 = 145634791889 is a prime.
It is a super-2 number, since 2×1456347919052 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1513764 + ... + 1607093.
It is an arithmetic number, because the mean of its divisors is an integer number (5659675983).
Almost surely, 2145634791905 is an apocalyptic number.
145634791905 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
145634791905 is a deficient number, since it is larger than the sum of its proper divisors (126029655279).
145634791905 is a wasteful number, since it uses less digits than its factorization.
145634791905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3120946 (or 3120943 counting only the distinct ones).
The product of its (nonzero) digits is 4082400, while the sum is 54.
The spelling of 145634791905 in words is "one hundred forty-five billion, six hundred thirty-four million, seven hundred ninety-one thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •