Base | Representation |
---|---|
bin | 11010000101001111… |
… | …11010111001111000 |
3 | 1100010212110222120100 |
4 | 31002213322321320 |
5 | 212134140204112 |
6 | 10233245355400 |
7 | 1003666446321 |
oct | 150247727170 |
9 | 40125428510 |
10 | 14002663032 |
11 | 5a36157a96 |
12 | 2869568b60 |
13 | 1422032037 |
14 | 96b9ab448 |
15 | 56e4ac2dc |
hex | 3429fae78 |
14002663032 has 24 divisors (see below), whose sum is σ = 37923879240. Its totient is φ = 4667554320.
The previous prime is 14002663027. The next prime is 14002663093. The reversal of 14002663032 is 23036620041.
14002663032 is a `hidden beast` number, since 1 + 4 + 0 + 0 + 26 + 630 + 3 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 14002662987 and 14002663005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 97240644 + ... + 97240787.
It is an arithmetic number, because the mean of its divisors is an integer number (1580161635).
Almost surely, 214002663032 is an apocalyptic number.
14002663032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14002663032 is an abundant number, since it is smaller than the sum of its proper divisors (23921216208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14002663032 is a wasteful number, since it uses less digits than its factorization.
14002663032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194481443 (or 194481436 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The spelling of 14002663032 in words is "fourteen billion, two million, six hundred sixty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •