Base | Representation |
---|---|
bin | 1000011101011000101… |
… | …0100011000010011111 |
3 | 111220010002102000122001 |
4 | 2013112022203002133 |
5 | 4340112203304301 |
6 | 150432354103131 |
7 | 13333224126364 |
oct | 2072612430237 |
9 | 456102360561 |
10 | 145327009951 |
11 | 566a6343602 |
12 | 241b987aaa7 |
13 | 109203b76a6 |
14 | 7068cd446b |
15 | 3ba871ec01 |
hex | 21d62a309f |
145327009951 has 2 divisors, whose sum is σ = 145327009952. Its totient is φ = 145327009950.
The previous prime is 145327009921. The next prime is 145327010011. The reversal of 145327009951 is 159900723541.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145327009951 - 215 = 145326977183 is a prime.
It is a super-2 number, since 2×1453270099512 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145327009921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72663504975 + 72663504976.
It is an arithmetic number, because the mean of its divisors is an integer number (72663504976).
Almost surely, 2145327009951 is an apocalyptic number.
145327009951 is a deficient number, since it is larger than the sum of its proper divisors (1).
145327009951 is an equidigital number, since it uses as much as digits as its factorization.
145327009951 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 340200, while the sum is 46.
The spelling of 145327009951 in words is "one hundred forty-five billion, three hundred twenty-seven million, nine thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •