Base | Representation |
---|---|
bin | 10000110100010… |
… | …00010000100000 |
3 | 100211102221221200 |
4 | 20122020100200 |
5 | 242103123141 |
6 | 21555321200 |
7 | 3332023626 |
oct | 1032102040 |
9 | 324387850 |
10 | 141067296 |
11 | 726a0a47 |
12 | 3b2b0200 |
13 | 232c2096 |
14 | 14a41516 |
15 | c5b7ab6 |
hex | 8688420 |
141067296 has 36 divisors (see below), whose sum is σ = 401160942. Its totient is φ = 47022336.
The previous prime is 141067259. The next prime is 141067307. The reversal of 141067296 is 692760141.
It can be written as a sum of positive squares in only one way, i.e., 139712400 + 1354896 = 11820^2 + 1164^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 141067296.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 244621 + ... + 245196.
Almost surely, 2141067296 is an apocalyptic number.
141067296 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
141067296 is an abundant number, since it is smaller than the sum of its proper divisors (260093646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141067296 is a wasteful number, since it uses less digits than its factorization.
141067296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489833 (or 489822 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 141067296 is about 11877.1754217912. The cubic root of 141067296 is about 520.5655779201.
The spelling of 141067296 in words is "one hundred forty-one million, sixty-seven thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •