Base | Representation |
---|---|
bin | 1000011110101100001… |
… | …0001111111100101101 |
3 | 111221000111021021220110 |
4 | 2013223002033330231 |
5 | 4341321322444031 |
6 | 150531223010233 |
7 | 13345005252636 |
oct | 2075302177455 |
9 | 457014237813 |
10 | 145677156141 |
11 | 56865a58620 |
12 | 24296b99979 |
13 | 10977ac229a |
14 | 709d5dc88d |
15 | 3bc9336c46 |
hex | 21eb08ff2d |
145677156141 has 16 divisors (see below), whose sum is σ = 212141337408. Its totient is φ = 88186147200.
The previous prime is 145677156091. The next prime is 145677156197. The reversal of 145677156141 is 141651776541.
It is not a de Polignac number, because 145677156141 - 214 = 145677139757 is a prime.
It is a super-3 number, since 3×1456771561413 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145677156341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2547250 + ... + 2603811.
It is an arithmetic number, because the mean of its divisors is an integer number (13258833588).
Almost surely, 2145677156141 is an apocalyptic number.
145677156141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
145677156141 is a deficient number, since it is larger than the sum of its proper divisors (66464181267).
145677156141 is a wasteful number, since it uses less digits than its factorization.
145677156141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5151932.
The product of its digits is 705600, while the sum is 48.
The spelling of 145677156141 in words is "one hundred forty-five billion, six hundred seventy-seven million, one hundred fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •