Base | Representation |
---|---|
bin | 1000011100010100010… |
… | …0000111111010011011 |
3 | 111212101002120011102102 |
4 | 2013011010013322123 |
5 | 4334020232111212 |
6 | 150344104554015 |
7 | 13323141423125 |
oct | 2070504077233 |
9 | 455332504372 |
10 | 145040113307 |
11 | 565693a9941 |
12 | 2413978290b |
13 | 108a5b26b6b |
14 | 703cb72215 |
15 | 3b8d44d5c2 |
hex | 21c5107e9b |
145040113307 has 8 divisors (see below), whose sum is σ = 154183729392. Its totient is φ = 135964480000.
The previous prime is 145040113303. The next prime is 145040113343. The reversal of 145040113307 is 703311040541.
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 145040113307 - 22 = 145040113303 is a prime.
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 145040113307.
It is not an unprimeable number, because it can be changed into a prime (145040113301) 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, 16991294 + ... + 16999827.
It is an arithmetic number, because the mean of its divisors is an integer number (19272966174).
Almost surely, 2145040113307 is an apocalyptic number.
145040113307 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
145040113307 is a deficient number, since it is larger than the sum of its proper divisors (9143616085).
145040113307 is a wasteful number, since it uses less digits than its factorization.
145040113307 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33991389.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 145040113307 its reverse (703311040541), we get a palindrome (848351153848).
The spelling of 145040113307 in words is "one hundred forty-five billion, forty million, one hundred thirteen thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •