Base | Representation |
---|---|
bin | 11011001001011111… |
… | …11110111001010000 |
3 | 1101121202210222012120 |
4 | 31210233332321100 |
5 | 214322222424442 |
6 | 10410141054240 |
7 | 1024121112630 |
oct | 154457767120 |
9 | 41552728176 |
10 | 14575201872 |
11 | 61aa359990 |
12 | 29a9257380 |
13 | 14b383440a |
14 | 9c3a466c0 |
15 | 5a48a34ec |
hex | 364bfee50 |
14575201872 has 640 divisors, whose sum is σ = 54253670400. Its totient is φ = 3251404800.
The previous prime is 14575201871. The next prime is 14575201951. The reversal of 14575201872 is 27810257541.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14575201871) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 34620222 + ... + 34620642.
It is an arithmetic number, because the mean of its divisors is an integer number (84771360).
Almost surely, 214575201872 is an apocalyptic number.
14575201872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14575201872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27126835200).
14575201872 is an abundant number, since it is smaller than the sum of its proper divisors (39678468528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14575201872 is a wasteful number, since it uses less digits than its factorization.
14575201872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 515 (or 509 counting only the distinct ones).
The product of its (nonzero) digits is 156800, while the sum is 42.
The spelling of 14575201872 in words is "fourteen billion, five hundred seventy-five million, two hundred one thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •