Base | Representation |
---|---|
bin | 101010011010001… |
… | …1011011000001000 |
3 | 10200011200101212020 |
4 | 1110310123120020 |
5 | 10403243423033 |
6 | 353112244440 |
7 | 50156360556 |
oct | 12464333010 |
9 | 3604611766 |
10 | 1423029768 |
11 | 670299366 |
12 | 3386a0720 |
13 | 198a82c64 |
14 | d6dc8bd6 |
15 | 84de36b3 |
hex | 54d1b608 |
1423029768 has 64 divisors (see below), whose sum is σ = 3779784000. Its totient is φ = 445600512.
The previous prime is 1423029743. The next prime is 1423029779. The reversal of 1423029768 is 8679203241.
It is a super-2 number, since 2×14230297682 = 4050027441228267648, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1878 + ... + 53381.
It is an arithmetic number, because the mean of its divisors is an integer number (59059125).
Almost surely, 21423029768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1423029768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1889892000).
1423029768 is an abundant number, since it is smaller than the sum of its proper divisors (2356754232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1423029768 is a wasteful number, since it uses less digits than its factorization.
1423029768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55334 (or 55330 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 42.
The square root of 1423029768 is about 37723.0667894327. The cubic root of 1423029768 is about 1124.7896938239.
The spelling of 1423029768 in words is "one billion, four hundred twenty-three million, twenty-nine thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •