Base | Representation |
---|---|
bin | 111010011010011101011… |
… | …000111011101010010000 |
3 | 112012202012022121210111202 |
4 | 322122131120323222100 |
5 | 1011231424320410300 |
6 | 12312023115330332 |
7 | 563004063065312 |
oct | 72323530735220 |
9 | 15182168553452 |
10 | 4014140013200 |
11 | 1308429430899 |
12 | 549b734509a8 |
13 | 2316bb41a955 |
14 | dc3dd2617b2 |
15 | 6e63c548ad5 |
hex | 3a69d63ba90 |
4014140013200 has 30 divisors (see below), whose sum is σ = 9643971382674. Its totient is φ = 1605656005120.
The previous prime is 4014140013173. The next prime is 4014140013223. The reversal of 4014140013200 is 23100414104.
It can be written as a sum of positive squares in 3 ways, for example, as 205912658176 + 3808227355024 = 453776^2 + 1951468^2 .
It is a super-2 number, since 2×40141400132002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5017674617 + ... + 5017675416.
Almost surely, 24014140013200 is an apocalyptic number.
4014140013200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4014140013200 is an abundant number, since it is smaller than the sum of its proper divisors (5629831369474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4014140013200 is a wasteful number, since it uses less digits than its factorization.
4014140013200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10035350051 (or 10035350040 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 4014140013200 its reverse (23100414104), we get a palindrome (4037240427304).
The spelling of 4014140013200 in words is "four trillion, fourteen billion, one hundred forty million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •